Method for encoding/decoding image signal, and device for same

ABSTRACT

An image decoding method according to the present invention includes: a step for dividing the current picture into a plurality of tiles; a step for decoding division information indicating a slice defining method; and a step for determining a first slice on the basis of the division information.

CROSS-REFERENCE TO RELATED APPLICATIONS

This is a continuation of PCT International Application No.:PCT/KR2020/005118, filed on Apr. 16, 2020, which claims foreign priorityto Korean Patent Application No.: 10-2019-0044682, filed on Apr. 17,2019 and Korean Patent Application No.: 10-2019-0047457, filed on Apr.23, 2019 which are hereby incorporated by reference in their entireties.

FIELD OF THE DISCLOSURE

The present disclosure relates to a video signal encoding/decodingmethod and a device therefor.

DESCRIPTION OF THE RELATED ART

As display panels become larger, video service of higher quality isrequired. The biggest problem with high-definition video service is thatan amount of data is greatly increased. In order to solve the aboveproblem, research for improving the video compression rate is beingactively conducted. As a representative example, the Joint CollaborativeTeam on Video Coding (JCT-VC) was formed in 2009 by the Motion PictureExperts Group (MPEG) and the Video Coding Experts Group (VCEG) under theInternational Telecommunication Union-Telecommunication (ITU-T). TheJCT-VC proposed High Efficiency Video Coding (HEVC), a video compressionstandard that has about twice compression performance of H.264/AVC, andthat was approved as standard on Jan. 25, 2013. However, with rapiddevelopment of high-definition video services, the performance of HEVCis gradually showing its limitations.

DISCLOSURE Technical Purpose

A purpose of the present disclosure is to provide a method forpartitioning a picture into a plurality of tiles or a plurality ofslices in encoding/decoding a video signal, and a device for performingthe method.

A purpose of the present disclosure is to provide a method forpartitioning a slice based on a tile index in partitioning a pictureinto a plurality of tiles, and a device for performing the method.

A purpose of the present disclosure is to provide a method forpartitioning a slice based on difference information with a previousslice in partitioning a picture into a plurality of slices, and a devicefor performing the method.

Technical purposes obtainable from the present disclosure arenon-limited to the above-mentioned technical purposes, and otherunmentioned technical purposes may be clearly understood from thefollowing description by those having ordinary skill in the technicalfield to which the present disclosure pertains.

Technical Solution

A video signal decoding method according to the present disclosure mayinclude partitioning a current picture into a plurality of tiles,decoding partitioning information representing a definition method of aslice and determining the first slice based on the partitioninginformation. In this case, the partitioning information represents thefirst definition method based on raster scanning or the seconddefinition method based on a rectangular shape. In addition, when thepartitioning information indicates the second definition method, thefirst slice may be determined based on difference value informationrepresenting an index difference value between a first one among tilesin the first slice and a first one among tiles in the second slice.

A video signal encoding method according to the present disclosure mayinclude partitioning a current picture into a plurality of tiles,determining a definition method of a slice and determining the firstslice based on the definition method. In this case, the definitionmethod represents the first definition method based on raster scanningor the second definition method based on a rectangular shape. Inaddition, when the definition method indicates the second definitionmethod, difference value information representing an index differencevalue between a first one among tiles in the first slice and a first oneamong tiles in the second slice may be encoded.

In a video signal decoding method according to the present disclosure,signaling of the difference value information may be omitted for a firstone or last one among slices in the current picture.

In a video signal decoding method according to the present disclosure, asize of the first slice may be determined based on width information ofthe first slice and height information of the first slice.

In a video signal decoding method according to the present disclosure,when the first slice does not adjoin a left boundary in the currentpicture, the height information may be set the same as that of aprevious slice of the first slice.

In a video signal decoding method according to the present disclosure,when the partitioning information indicates the first definition method,the first slice may be determined based on information representing thenumber of tiles included by the first slice.

It is to be understood that the foregoing summarized features areexemplary aspects of the following detailed description of the presentdisclosure without limiting the scope of the present disclosure.

Technical Effect

According to the present disclosure, encoding/decoding efficiency may beimproved by partitioning a picture into a plurality of tiles or slices.

According to the present disclosure, encoding/decoding efficiency may beimproved by partitioning a slice based on a tile index.

According to the present disclosure, encoding/decoding efficiency may beimproved by partitioning a slice based on difference information with aprevious slice.

Effects obtainable from the present disclosure may be non-limited by theabove-mentioned effect, and other unmentioned effects may be clearlyunderstood from the following description by those having ordinary skillin the technical field to which the present disclosure pertains.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a view showing a block diagram of a video encoding device(encoder) according to an embodiment of the present disclosure;

FIG. 2 is a view showing a block diagram of a video decoding device(decoder) according to an embodiment of the present disclosure;

FIG. 3 is a view showing a basic coding tree unit according to anembodiment of the present disclosure;

FIG. 4 is a view showing various partitioning types of a coding block.

FIG. 5 is a view of an example showing an aspect of partitioning a CTU.

FIG. 6 is a flow diagram of an inter prediction method according to anembodiment of the present disclosure.

FIG. 7 is a diagram illustrating the nonlinear motion of an object.

FIG. 8 is a flow diagram of an inter-prediction method based on anaffine motion according to an embodiment of the present disclosure.

FIG. 9 is a diagram illustrating affine seed vectors for each affinemotion model.

FIG. 10 is a diagram illustrating affine vectors of sub-blocks in a4-parameter motion model.

FIG. 11 is a diagram of illustrating candidate blocks used to derive amerge candidate.

FIG. 12 is a diagram to explain the update aspect of a motioninformation table.

FIG. 13 is a diagram to explain the update aspect of a motioninformation table.

FIG. 14 is a diagram showing the update aspect of a motion informationtable.

FIG. 15 is a diagram showing an example in which the index of a savedmotion information candidate is renewed.

FIG. 16 is a diagram showing an example in which a redundancy check isperformed only for a part of merge candidates.

FIG. 17 is a diagram showing an example in which a redundancy check witha specific merge candidate is omitted.

FIG. 18 is a diagram showing an example in which a candidate blockincluded in the same merge processing region as a current block is setto be unavailable as a merge candidate.

FIG. 19 is a diagram showing an example deriving a merge candidate for acurrent block when a current block is included in a merge processingregion.

FIG. 20 is a diagram showing a temporary motion information table.

FIG. 21 is a diagram showing an example in which a motion informationtable and a temporary motion information table are unified.

FIG. 22 is a flow diagram of an intra-prediction method according to anembodiment of the present disclosure.

FIG. 23 is a diagram showing intra-prediction modes.

FIG. 24 and FIG. 25 are a diagram showing the example of aone-dimensional array in which reference samples are arranged in a row.

FIG. 26 is a diagram illustrating an angle formed by directionalintra-prediction modes with a straight line parallel to an x-axis.

FIG. 27 is a diagram showing an aspect in which a prediction sample isobtained in case that a current block has a non-square shape.

FIG. 28 is a diagram showing wide angle intra-prediction modes.

FIG. 29 is a diagram showing an example in which whether transform skipis performed is determined per sub-block.

FIG. 30 is a diagram showing an example in which sub-blocks use the sametransform type.

FIG. 31 is a flow diagram showing a process of determining a blockingstrength.

FIG. 32 shows predefined filter candidates.

FIG. 33 is a diagram showing a picture partitioning method according toan embodiment of the present disclosure.

FIG. 34 shows an example in which a picture is partitioned into aplurality of tiles.

FIG. 35 is a diagram for explaining a generation aspect of a brick.

FIGS. 36 and 37 are diagrams showing an example in which a slice isdefined based on a raster order.

FIG. 38 is a diagram showing an example in which only a slice in arectangular shape is allowed.

DETAILED DESCRIPTION OF THE DISCLOSURE

Hereinafter, embodiments of the present disclosure will be described indetail with reference to the accompanying drawings.

Image encoding and decoding is performed on a basis of a block. In anexample, for a coding block, a transform block, or a prediction block,encoding/decoding processes such as transform, quantization, prediction,in-loop filtering, reconstruction, etc. may be performed.

Hereinafter, an encoding/decoding target block is referred to as a“current block”. In an example, a current block may represent a codingblock, a transform block, or a prediction block according to a currentprocess of encoding/decoding.

In addition, the term “unit” used in the present specificationrepresents a basis unit for performing a specific encoding/decodingprocess, and a “block” may be understood to represent a sample arrayhaving a predetermined size. Unless otherwise stated, “block” and “unit”may be used interchangeably. In an example, in examples described later,a coding block and a coding unit may be understood to have the samemeaning as each other.

FIG. 1 is view showing a block diagram of an image encoding apparatus(encoder) according to an embodiment of the present disclosure.

Referring to FIG. 1, an image encoding apparatus 100 may include apicture partitioning unit 110, prediction units 120 and 125, a transformunit 130, a quantization unit 135, a rearrangement unit 160, an entropyencoding unit 165, a dequantization unit 140, an inverse-transform unit145, a filter unit 150, and a memory 155.

Components described in FIG. 1 are independently illustrated in order toshow different characteristic functions in an image encoding apparatus,and the figure does not mean that each component is constituted byseparated hardware or one software unit. That is, each component is justenumerated for convenience of explanation, at least two components ofrespective components may constitute one component or one component maybe partitioned into a plurality of components which may perform theirfunctions. Even an embodiment of integrating respective components andembodiment of dividing a component are also included in the scope of thepresent disclosure unless they are departing from the spirit of thepresent disclosure.

Further, some components are not requisite components that performessential functions of the present disclosure but are optionalcomponents for just improving performance. The present disclosure may beimplemented with the requisite component for implementing the spirit ofthe present disclosure other than the component used to just improve theperformance and a structure including only the requisite component otherthan the optional component used to just improve the performance is alsoincluded in the scope of the present disclosure.

The picture partitioning unit 110 may partition an input picture into atleast one processing unit. In this connection, the processing unit maybe a prediction unit (PU), a transform unit (TU), or a coding unit (CU).In the picture partitioning unit 110, a single picture may bepartitioned into combinations of a plurality of coding units, predictionunits, and transform units, and the picture may be encoded by selectinga combination of the coding units, the prediction units, and thetransform units according to a predetermined condition (for example,cost function).

For example, a single picture may be partitioned into a plurality ofcoding units. In order to partition a picture into coding units, arecursive tree structure such as a quad-tree structure may be used, anda coding unit that is originated from a root such as a single image orlargest coding unit may be partitioned into other coding units and mayhave child nodes as many as the partitioned coding units. A coding unitthat is no longer partitioned according to certain restrictions becomesa leaf node. Namely, when it is assumed that only square partitioning isavailable for a single coding unit, a single coding unit may bepartitioned into at most four other coding units.

Hereinafter, in the embodiment of the present disclosure, a coding unitmay be used as a unit for encoding or may be used as a unit fordecoding.

A prediction unit may be obtained by partitioning a single coding unitinto at least one square or rectangle having the same size, or a singlecoding unit may be partitioned into prediction units in such a mannerthat one prediction unit may be different from another prediction unitin a shape and/or size.

In generation of a prediction unit based on a coding block to whichintra-prediction is being performed, when the coding unit is not thesmallest coding unit, intra-prediction may be performed withoutperforming partitioning into a plurality of N×N prediction units.

The prediction units 120 and 125 may include an inter-prediction unit120 performing inter-prediction and an intra prediction unit 125performing intra-prediction. Whether to perform inter-prediction orintra-prediction on a prediction unit may be determined, and detailedinformation (for example, an intra-prediction mode, a motion vector, areference picture, etc.) according to each prediction method may bedetermined. In this connection, a processing unit on which prediction isperformed may differ with a processing unit for which a predictionmethod, and detail thereof are determined. For example, a predictionmethod, a prediction mode, etc. may be determined on the basis of aprediction unit, and prediction may be performed on the basis of atransform unit. A residual value (residual block) between the generatedprediction block and an original block may be input to the transformunit 130. In addition, prediction mode information used for prediction,motion vector information, etc. may be encoded using a residual value bythe entropy encoding unit 165 and may be transmitted to the decoder.When a specific encoding mode is used, an original block is encoded asit is and transmitted to a decoding unit without generating a predictionblock through the prediction unit 120 or 125.

The inter-prediction unit 120 may predict a prediction unit on the basisof information on at least one of a previous picture and a subsequentpicture of a current picture, or in some cases, may predict a predictionunit on the basis of information on some encoded regions in the currentpicture. The inter-prediction unit 120 may include a reference pictureinterpolation unit, a motion prediction unit, and a motion compensationunit.

The reference picture interpolation unit may receive reference pictureinformation from the memory 155, and generate pixel information of apixel at an integer or less from the reference picture. In case of aluma pixel, an 8-tap DCT-based interpolation filter having differentcoefficients may be used so as to generate pixel information on a pixelat an integer or less for a ¼ pixel unit. In case of a chroma signal, a4-tap DCT-based interpolation filter having different filtercoefficients may be used so as to generate pixel information on a pixelat an integer or less for a ⅛ pixel unit.

The motion prediction unit may perform motion prediction based on areference picture interpolated by the reference picture interpolationunit. As methods for calculating a motion vector, various methods, suchas a full search-based block matching algorithm (FBMA), a three stepsearch (TSS) algorithm, a new three-step search (NTS) algorithm, etc.may be used. A motion vector may have a motion vector value in a unit of½ or ¼ pixel on the basis of the interpolated pixel. The motionprediction unit may predict a current prediction unit by varying amotion prediction method. As motion prediction methods, various methods,such as a skip method, a merge method, an advanced motion vectorprediction (AMVP) method, an intra block copy method, etc. may be used.

The intra-prediction unit 125 may generate a prediction unit on thebasis of information on a reference pixel around a current block, whichis pixel information in a current picture. When a neighboring block of acurrent prediction unit is a block for which inter-prediction isperformed, and thus a reference pixel is a pixel for whichinter-prediction is performed, a reference pixel included in the blockfor which inter-prediction is performed may be replaced by informationon a reference pixel of a neighboring block for which intra-predictionis performed. In other words, when a reference pixel is unavailable, atleast one reference pixel of available reference pixels may be used inplace of unavailable reference pixel information.

A prediction mode in intra-prediction may include a directionalprediction mode using reference pixel information according to aprediction direction and a non-directional mode not using directionalinformation when performing prediction. A mode for predicting lumainformation may be different from a mode for predicting chromainformation. In order to predict the chroma information, information onan intra-prediction mode used for predicting the luma information orinformation on a predicted luma signal may be used.

In performing intra-prediction, when a prediction unit is identical in asize with a transform unit, intra-prediction may be performed on theprediction unit on the basis of pixels positioned at the left, thetop-left, and the top of the prediction unit. However, in performingintra-prediction, when a prediction unit is different in a size with atransform unit, intra-prediction may be performed by using a referencepixel based on the transform unit. In addition, intra-prediction usingN×N partitioning may be only used for the smallest coding unit.

In an intra-prediction method, a prediction block may be generated afterapplying an adaptive intra smoothing (AIS) filter to a reference pixelaccording to a prediction mode. A type of AIS filter applied to areference pixel may vary. In order to perform an intra-predictionmethod, an intra prediction mode for a current prediction unit may bepredicted from an intra-prediction mode of a prediction unit presentaround the current prediction unit. In predicting a prediction mode fora current prediction unit by using mode information predicted from aneighboring prediction unit, when an intra prediction mode for thecurrent prediction unit is identical to an intra prediction mode of theneighboring prediction unit, information indicating that the currentprediction unit and the neighboring prediction unit have the sameprediction mode may be transmitted by using predetermined flaginformation. When a prediction mode for the current prediction unit isdifferent from prediction modes of the neighboring prediction units,entropy encoding may be performed to encode information on a predictionmode for a current block.

In addition, a residual block may be generated which includesinformation on a residual value that is a difference value between aprediction unit for which prediction is performed on by the predictionunit 120 or 125, and an original block of the prediction unit. Thegenerated residual block may be input to the transform unit 130.

The transform unit 130 may perform transform on a residual block, whichincludes information on a residual value between an original block and aprediction unit generated by the prediction unit 120 or 125, by using atransform method such as discrete cosine transform (DCT) or discretesine transform (DST). In this connection, a DCT transform core includesat least one of DCT2 or DCT8 and a DST transform core includes DST7.Whether to apply DCT, or DST so as to perform transform on a residualblock may be determined on the basis of information on anintra-prediction mode of a prediction unit which is used to generate theresidual block. It is possible to skip a transform for a residual block.A flag indicating whether or not to skip a transform for a residualblock may be encoded. A transform skip may be allowed for a residualblock whose a size is smaller than or equal to a threshold value, aresidual block of a luma component, or a residual block of a chromacomponent under 4:4:4 format.

The quantization unit 135 may perform quantization on values transformedinto a frequency domain by the transform unit 130. A quantizationcoefficient may vary according to a block or importance of an image.Values calculated in the quantization unit 135 may be provided to thedequantization unit 140 and the rearrangement unit 160.

The rearrangement unit 160 may perform rearrangement on coefficientvalues with respect to quantized residual values.

The rearrangement unit 160 may change coefficients in the form of atwo-dimensional block into coefficients in the form of a one-dimensionalvector through a coefficient scanning method. For example, therearrangement unit 160 may scan from a DC coefficient to a coefficientin a high frequency domain by using a zigzag scanning method so as tochange the coefficients into the form of a one-dimensional vector.According to a size and an intra prediction mode of a transform unit,rather than zigzag scanning, vertical directional scanning wherecoefficients in the form of a two-dimensional block are scanned in acolumn direction, or horizontal directional scanning where coefficientsin the form of two-dimensional block are scanned in a row direction maybe used. In other words, which scanning method among zigzag scanning,vertical directional scanning, and horizontal directional scanning isused may be determined according to a size and an intra prediction modeof a transform unit.

The entropy encoding unit 165 may perform entropy encoding on the basisof values calculated by the rearrangement unit 160. Entropy encoding mayuse various encoding methods, for example, exponential Golomb coding,context-adaptive variable length coding (CAVLC), or context-adaptivebinary arithmetic coding (CABAL).

The entropy encoding unit 165 may encode various types of information,such as information on a residual value coefficient and information on ablock type of a coding unit, information on a prediction mode,information on a partitioning unit, information on a prediction unit,information on a partitioning unit, information on a prediction unit andinformation on a transmission unit, information on a motion vector,information on a reference frame, information on a block interpolation,filtering information, etc. obtained from the rearrangement unit 160 andthe prediction units 120 and 125.

The entropy encoding unit 165 may entropy encode coefficients of acoding unit input from the rearrangement unit 160.

The dequantization unit 140 may perform dequantization on valuesquantized in the quantization unit 135, and the inverse-transform unit145 may perform inverse-transform on values transformed in the transformunit 130. A residual value generated by the dequantization unit 140 andthe inverse-transform unit 145 may be added with a prediction unitpredicted by a motion estimation unit, a motion compensation unit, orthe intra-prediction unit which are included in the prediction units 120and 125 so as to generate a reconstructed block.

The filter unit 150 may include at least one of a deblocking filter, anoffset correction unit, and an adaptive loop filter (ALF).

The deblocking filter may remove block distortion that occurs due toboundaries between blocks in a reconstructed picture. In order todetermine whether or not to perform deblocking, whether or not to applya deblocking filter to a current block may be determined on the basis ofpixels included in several rows and columns included in a block. When adeblocking filter is applied to a block, a strong filter or a weakfilter is applied according to required deblocking filtering strength.In addition, in applying a deblocking filter, when performing horizontaldirectional filtering and vertical directional filtering, horizontaldirectional filtering and vertical directional filtering may beconfigured to be processed in parallel.

The offset correction unit may correct an original image by an offset ina unit of a pixel with respect to an image for which deblocking isperformed. In order to perform offset correction on a specific picture,a method of applying a offset to a region which is determined afterpartitioning pixels of the image into the predetermined number ofregions, or a method of applying an offset according to edge informationof each pixel may be used.

Adaptive loop filtering (ALF) may be performed on the basis of a valueobtained by comparing a filtered reconstructed image with an originalimage. Pixels included in an image may be partitioned into predeterminedgroups, a filter to be applied to each of the groups may be determined,and filtering may be individually performed on each group. Informationon whether or not to apply ALF and may be transmitted for each codingunit (CU) for a luma signal, and a shape and a filter coefficient of anALF filter to be applied may vary on the basis of each block.Alternatively, an ALF filter having the same shape (fixed shape) may beapplied regardless of a feature of a block to which the filter will beapplied.

In the memory 155, a reconstructed block or picture calculated throughthe filter unit 150 may be stored. The stored reconstructed block orpicture may be provided to the prediction unit 120 or 125 whenperforming inter-prediction.

FIG. 2 is view showing a block diagram of an image decoding apparatus(decoder) according to an embodiment of the present disclosure.

Referring to FIG. 2, an image decoding apparatus 200 may include: anentropy decoding unit 210, a rearrangement unit 215, a dequantizationunit 220, an inverse-transform unit 225, prediction units 230 and 235, afilter unit 240, and a memory 245.

When an image bitstream is input from the encoder, the input bitstreammay be decoded according to an inverse process of the image encodingapparatus.

The entropy decoding unit 210 may perform entropy decoding according tothe inverse process of the entropy encoding by the entropy encoding unitof the image encoder. For example, in association with the methodsperformed by the image encoder apparatus, various methods, such asexponential Golomb coding, context-adaptive variable length coding(CAVLC), or context-adaptive binary arithmetic coding (CABAC) may beapplied.

The entropy decoding unit 210 may decode information on intra-predictionand inter-prediction performed by the encoder.

The rearrangement unit 215 may perform rearrangement on the bitstreamentropy decoded by the entropy decoding unit 210 on the basis of therearrangement method used in the encoder. Coefficients represented inthe form of a one-dimensional vector may be reconstructed and rearrangedinto coefficients in the form of a two-dimensional block. Therearrangement unit 215 may perform rearrangement through a method ofreceiving information related to coefficient scanning performed in theencoder and of inversely scanning on the basis of the scanning orderperformed in the encoder.

The dequantization unit 220 may perform dequantization on the basis of aquantization parameter received from the encoder and coefficient valuesof the rearranged block.

The inverse-transform unit 225 may perform, an inverse transform, thatis inverse DCT or inverse DST, against to a transform, that is DCT orDST, performed on the quantization result by the transform unit in theimage encoder. In this connection, a DCT transform core may include atleast one of DCT2 or DCT8, and a DST transform core may include DST7.Alternatively, when the transform is skipped in the image encoder, theinverse-transform also not be performed in the inverse-transform unit225. Inverse transform may be performed on the basis of a transmissionunit determined by the image encoder. The inverse transform unit 225 ofthe image decoder may selectively perform a transform method (forexample, DCT, or DST) according to multiple pieces of information, suchas a prediction method, a size of a current block, a predictiondirection, etc.

The prediction unit 230 or 235 may generate a prediction block on thebasis of information related to a prediction block received from theentropy decoding unit 210 and information on a previously decoded blockor picture received from the memory 245.

As described above, as the operation of the image encoder, in performingintra-prediction, when a prediction unit is identical in size with atransform unit, intra-prediction may be performed on the prediction uniton the basis of pixels positioned at the left, the top-left, and the topof the prediction unit. However, in performing intra-prediction, when aprediction unit is different in size with a transform unit,intra-prediction may be performed by using a reference pixel based onthe transform unit. In addition, intra-prediction using N×N partitioningmay be only used for the smallest coding unit.

The prediction units 230 and 235 may include a PU determination module,an inter-prediction unit, and an intra-prediction unit. The PUdetermination unit may receive various types of information, such asinformation on a prediction unit, information on a prediction mode of anintra-prediction method, information on a motion prediction of aninter-prediction method, etc. which are input from the entropy decodingunit 210, divide a prediction unit in a current coding unit, anddetermine whether inter-prediction or intra-prediction is performed onthe prediction unit. By using information required in inter-predictionof a current prediction unit received from the image encoder, theinter-prediction unit 230 may perform inter-prediction on the currentprediction unit on the basis of information on at least one of aprevious picture and a subsequent picture of a current picture includingthe current prediction unit. Alternatively, inter-prediction may beperformed on the basis of information on some pre-reconstructed regionsin a current picture including the current prediction unit.

In order to perform inter-prediction, which method among a skip mode, amerge mode, an AMVP mode, or an intra block copy mode is used as amotion prediction method for a prediction unit included in a coding unitmay be determined on the basis of the coding unit.

The intra prediction unit 235 may generate a prediction block on thebasis of information on a pixel within a current picture. When aprediction unit is a prediction unit for which intra-prediction has beenperformed, intra-prediction may be performed on the basis of informationon an intra-prediction mode of a prediction unit received from the imageencoder. The intra prediction unit 235 may include an adaptive intrasmoothing (AIS) filter, a reference pixel interpolation module, or a DCfilter. The AIS filter may perform filtering on a reference pixel of acurrent block, and whether to apply the filter may be determinedaccording to a prediction mode for a current prediction unit. Aprediction mode of the prediction unit and information on an AIS filterwhich are received from the image encoder may be used when performingAIS filtering on a reference pixel of a current block. When a predictionmode for the current block is a mode to which AIS filtering is notapplied, the AIS filter may not be applied.

When a prediction mode of a prediction unit is a prediction mode forwhich intra-prediction is performed on the basis of a pixel valueobtained by interpolating reference pixels, the reference pixelinterpolation unit may interpolate the reference pixels so as togenerate a reference pixel having a unit of an integer or less. When aprediction mode for a current prediction unit is a prediction mode wherea prediction block is generated without interpolating reference pixels,the reference pixels may not be interpolated. The DC filter may generatea prediction block through filtering when a prediction mode for acurrent block is a DC mode.

A reconstructed block or picture may be provided to the filter unit 240.The filter unit 240 may include a deblocking filter, an offsetcorrection module, and an ALF.

Information on whether or not a deblocking filter has been applied to acorresponding block or picture and information on whether a strongfilter or a weak filter is applied when the deblocking filter is appliedmay be received from the image encoder. The deblocking filter of theimage decoder may receive information on a deblocking filter from theimage encoder, and the image decoder may perform deblocking filtering ona corresponding block.

The offset correction unit may perform offset correction on areconstructed image on the basis of a type of offset correction,information on an offset value, etc. applied to an image when performingencoding.

The ALF may be applied to a coding unit on the basis of information onwhether or not to apply ALF, information on an ALF coefficient, etc.received from the encoder. The above ALF information may be provided bybeing included in a particular parameter set.

In the memory 245, a reconstructed picture or block may be stored so asto be used as a reference picture or reference block, and thereconstructed picture may be provided to an output unit.

FIG. 3 is a view showing a basic coding tree unit according to anembodiment of the present disclosure.

The largest coding block may be defined as a coding tree block. A singlepicture may be partitioned into a plurality of coding tree units (CTU).A CTU may be a coding unit of the largest size, and may be referred toas the largest coding unit (LCU). FIG. 3 is a view showing an examplewhere a single picture is partitioned into a plurality of CTUs.

A size of a CTU may be defined in a picture level or sequence level. Forthe same, information representing a size of a CTU may be signaledthrough a picture parameter set or sequence parameter set.

In an example, a size of a CTU for the entire picture within a sequencemay be set to 128×128. Alternatively, any one of 128×128 or 256×256 maybe determined as a size of a CTU in a picture level. In an example, aCTU may be set to have a size of 128×128 in a first picture, and a sizeof 256×256 in a second picture.

Coding blocks may be generated by partitioning a CTU. A coding blockrepresents a basic unit for performing encoding/decoding. In an example,prediction or transform may be performed for each coding block, or aprediction encoding mode may be determined for each coding block. Inthis connection, the prediction encoding mode represents a method ofgenerating a prediction image. In an example, a prediction encoding modemay include intra-prediction, inter-prediction, current picturereferencing (CPR), intra block copy (IBC) or combined prediction. For acoding block, a prediction block of the coding block may be generated byusing a prediction encoding mode of at least one of intra-prediction,inter-prediction, current picture referencing, or combined prediction.

Information representing a prediction encoding mode for a current blockmay be signaled in a bitstream. In an example, the information may be a1-bit flag representing whether a prediction encoding mode is an intramode or an inter mode. When a prediction encoding mode for a currentblock is determined as an inter mode, current picture referencing orcombined prediction may be available.

Current picture referencing is setting a current picture as a referencepicture and obtaining a prediction block of a current block from aregion that has been already encoded/decoded within a current picture.In this connection, the current picture means a picture including thecurrent block. Information representing whether or not current picturereferencing is applied to a current block may be signaled in abitstream. In an example, the information may be a 1-bit flag. When theflag is TRUE, a prediction encoding mode for a current block may bedetermined as current picture referencing, and when the flag is FALSE, aprediction encoding mode for a current block may be determined asinter-prediction.

Alternatively, a prediction encoding mode for a current block may bedetermined on the basis of a reference picture index. In an example,when a reference picture index indicates a current picture, a predictionencoding mode for a current block may be determined as current picturereferencing. When a reference picture index indicates a picture otherthan a current picture, a prediction encoding mode for a current blockmay be determined as inter-prediction. In other words, current picturereferencing is a prediction method using information on a region thathas been already encoded/decoded within a current picture, andinter-prediction is a prediction method using information on anotherpicture that has been already encoded/decoded.

Combined prediction represents a combined encoding mode combining atleast two of intra-prediction, inter-prediction, and current picturereferencing. In an example, when combined prediction is applied, a firstprediction block may be generated on the basis of any one ofintra-prediction, inter-prediction or current picture referencing, and asecond prediction block may be generated on the basis of another. When afirst prediction block and a second prediction block are generated, afinal prediction block may be generated by calculating an average orweighted sum of the first prediction block and the second predictionblock. Information representing whether or not to apply combinedprediction to a current block may be signaled in a bitstream. Theinformation may be a 1-bit flag.

FIG. 4 is a view showing various partitioning types a coding block.

A coding block may be partitioned into a plurality of coding blocks onthe basis of quad-tree partitioning, binary-tree partitioning or ternarytree partitioning. The partitioned coding block may be partitioned againinto a plurality of coding blocks on the basis of quad-treepartitioning, binary-tree partitioning or ternary tree partitioning.

Quad-tree partitioning represents a method of partitioning a currentblock into four blocks. As a result of quad-tree partitioning, a currentblock may be partitioned into four square partitions (refer to“SPLIT_QT” of FIG. 4 (a)).

Binary-tree partitioning represents a method of partitioning a currentblock into two blocks. Partitioning a current block into two blocksalong a vertical direction (that is, using a vertical line across thecurrent block) may be referred to vertical directional binary-treepartitioning, and partitioning a current block into two blocks along ahorizontal direction (that is, using a horizontal line across thecurrent block) may be referred to as horizontal directional binary-treepartitioning. As a result of binary-tree partitioning, a current blockmay be partitioned into two non-square partitions. “SPLIT_BT_VER” ofFIG. 4 (b) is a view showing a result of vertical directionalbinary-tree partitioning, and “SPLIT_BT_HOR” of FIG. 4 (c) is a viewshowing a result of horizontal directional binary-tree partitioning.

Ternary-tree partitioning represents a method of partitioning a currentblock into three blocks. Partitioning a current block into three blocksalong a vertical direction (that is, using two vertical lines across thecurrent block) may be referred to vertical directional ternary-treepartitioning, and partitioning a current block into three blocks along ahorizontal direction (that is, using two horizontal lines across thecurrent block) may be referred to as horizontal directional ternary-treepartitioning. As a result of ternary-tree partitioning, a current blockmay be partitioned into three non-square partitions. In this connection,a width/height of a partition positioned at the center of a currentblock may be twice than a width/height of other partitions. “SPLIT TTVER” of FIG. 4 (d) is a view showing a result of vertical directionalternary-tree partitioning, and “SPLIT TT HOR” of FIG. 4 (e) is a viewshowing a result of horizontal directional ternary-tree partitioning.

The number of partitioning times of a CTU may be defined as apartitioning depth. The maximum partitioning depth of a CTU may bedetermined in a sequence or picture level. Accordingly, the maximumpartitioning depth of a CTU may vary on the basis of a sequence orpicture.

Alternatively, the maximum partitioning depth may be independentlydetermined for each partitioning method. In an example, the maximumpartitioning depth where quad-tree partitioning is allowed may differfrom the maximum partitioning depth where binary-tree partitioningand/or ternary-tree partitioning is allowed.

The encoder may signal information representing at least one of apartitioning type and a partitioning depth of a current block in abitstream. The decoder may determine a partitioning type and apartitioning depth of a CTU on the basis of the information obtained byparsing a bitstream.

FIG. 5 is a view of an example showing an aspect of partitioning a CTU.

Partitioning a coding block by using quad-tree partitioning, binary-treepartitioning and/or ternary-tree partitioning may be referred to asmulti-tree partitioning.

Coding blocks generated by partitioning a coding block by applyingmulti-tree partitioning may be referred to child coding blocks. When apartitioning depth of a coding block is k, a partitioning depth of childcoding blocks is set to k+1.

To the contrary, for coding blocks having a partitioning depth of k+1, acoding block having a partitioning depth of k may be referred to as aparent coding block.

A partitioning type of a current coding block may be determined on thebasis of at least one of a partitioning type of a parent coding blockand a partitioning type of a neighboring coding block. In thisconnection, the neighboring coding block may be a block adjacent to acurrent coding block, and include at least one of an top neighboringblock, a left neighboring block, or a neighboring block adjacent to thetop-left corner of the current coding block. In this connection, thepartitioning type may include whether or not to apply quad-treepartitioning, whether or not to apply binary-tree partitioning, adirection of binary-tree partitioning, whether or not to applyternary-tree partitioning, or a direction of ternary-tree partitioning.

In order to determine a partitioning type of a coding block, informationrepresenting whether or not a coding block is partitioned may besignaled in a bitstream. The information is a 1-bit flag of“split_cu_flag”, and when the flag is TRUE, it may represent that acoding block is partitioned by a multi tree partitioning method.

When split_cu_flag is TRUE, information representing whether or not acoding block is partitioned by quad-tree partitioning may be signaled ina bitstream. The information is a 1-bit flag of split_qt_flag, and whenthe flag is TRUE, a coding block may be partitioned into four blocks.

In an example, in an example shown in FIG. 5, a CTU is partitioned byquad-tree partitioning, and thus four coding blocks having apartitioning depth of 1 are generated. In addition, it is shown thatquad-tree partitioning is applied again to the first coding block andthe fourth coding block among four coding blocks generated by quad-treepartitioning. As a result, four coding blocks having a partitioningdepth of 2 may be generated.

In addition, by applying again quad-tree partitioning to a coding blockhaving a partitioning depth of 2, a coding block having a partitioningdepth of 3 may be generated.

When quad-tree partitioning is not applied to a coding block, whether toperform binary-tree partitioning or ternary-tree partitioning for thecoding block may be determined according to at least one of a size ofthe coding block, whether or not the coding block is positioned at apicture boundary, the maximum partitioning depth, or a partitioning typeof a neighboring block. When it is determined to perform binary-treepartitioning or ternary-tree partitioning for the coding block,information representing a partitioning direction may be signaled in abitstream. The information may be a 1-bit flag ofmtt_split_cu_vertical_flag. Whether a partitioning direction is avertical direction or a horizontal direction may be determined on thebasis of the flag. Additionally, information representing which one ofbinary-tree partitioning or ternary-tree partitioning is applied to thecoding block may be signaled in a bitstream. The information may be a1-bit flag of mtt_split_cu_binary_flag. Whether binary-tree partitioningis applied to the coding block or ternary-tree partitioning is appliedto the coding block may be determined on the basis of the flag.

In an example, in an example shown in FIG. 5, vertical directionalbinary-tree partitioning is applied to a coding block having apartitioning depth of 1, vertical directional ternary-tree partitioningis applied to a left coding block among coding blocks generated by thepartitioning, and vertical directional binary-tree partitioning isapplied to a right coding block.

Inter-prediction is a prediction encoding mode predicting a currentblock by using information on a previous picture. In an example, a block(hereinafter, collocated block) at the same position with a currentblock within a previous picture may be set as a prediction block of thecurrent block. Hereinafter, a prediction block generated on the basis ofa collocated block of the current block may be referred to as acollocated prediction block.

To the contrary, when an object present in a previous picture has movedto another position in a current picture, a current block may beeffectively predicted by using motions of the object. For example, whena motion direction and a size of the object is determined by comparing aprevious picture with a current picture, a prediction block (orprediction image) of the current block may be generated according tomotion information of the objects. Hereinafter, a prediction blockgenerated by using motion information may be referred to as a motionprediction block.

A residual block may be generated by subtracting a prediction block froma current block. In this connection, in case where an object moves,energy of a residual block may be reduced by using a motion predictionblock rather than using a collocated prediction block, and thuscompression performance of the residual block may be improved.

As above, generating a prediction block by using motion information maybe referred to as motion estimation prediction. In the mostinter-prediction, a prediction block may be generated on the basis ofmotion compensation prediction.

Motion information may include at least one of a motion vector, areference picture index, a prediction direction, and a bidirectionalweighting factor index. A motion vector represents a motion direction ofan object and a magnitude. A reference picture index specifies areference picture of a current block among reference pictures includedin a reference picture list. A prediction direction indicates any one ofuni-directional L0 prediction, uni-directional L1 prediction, orbidirectional prediction (L0 prediction and L1 prediction). At least oneof L0 directional motion information and L1 directional motioninformation may be used according to a prediction direction of a currentblock. A bidirectional weighting factor index specifies a weightingfactor applied to an L0 prediction block and a weighting factor appliedto an L1 prediction block.

FIG. 6 is a flow diagram of an inter-prediction method according to theembodiment of the present disclosure.

In reference to FIG. 6, an inter-prediction method includes determiningan inter-prediction mode for a current block (S601), obtaining motioninformation of the current block according to the determinedinter-prediction mode (S602), and performing motion compensationprediction for a current block on the basis of the obtained motioninformation (S603).

In this connection, the inter-prediction mode may represent variousmethods for determining motion information of a current block, andinclude an inter-prediction mode using translation motion information,an inter-prediction mode using affine motion information. In an example,an inter-prediction mode using translation motion information mayinclude a merge mode and a motion vector prediction mode, and aninter-prediction mode using affine motion information may include anaffine merge mode and an affine motion vector prediction mode. Motioninformation on a current block may be determined on the basis of aneighboring block neighboring the current block or information obtainedby parsing a bitstream. Motion information of a current block may bederived from motion information of another block. In this connection,another block may be a block encoded/decoded by inter predictionprevious to the current block. Setting motion information of a currentblock to be the same as motion information of another block may bedefined as a merge mode. Also, setting a motion vector of another blockas a prediction value of a motion vector of the current block may bedefined as a motion vector prediction mode.

Hereinafter, an inter-prediction method using affine motion informationis described in detail.

FIG. 7 is a diagram illustrating a non-linear motion of an object.

In a video, a non-linear motion of an object may occur. In an example,as in an example shown in FIG. 7, a non-linear motion of an object mayoccur such as camera zoom-in, zoom-out, rotation or affine transform,etc. For the nonlinear motion of the object, a translation motion vectormay not effectively express the motion of the object. Accordingly, for aregion in which the non-linear motion of the object is occur, encodingefficiency may be improved by using affine motion, instead oftranslation motion.

FIG. 8 is a flow diagram of an inter-prediction method based on anaffine motion according to an embodiment of the present disclosure.

Whether an inter-prediction method based on an affine motion is appliedto a current block may be determined based on information parsed from abitstream. Concretely, based on at least one of a flag indicatingwhether an affine merge mode is applied to a current block or a flagindicating whether an affine motion vector prediction mode is applied toa current block, whether an inter-prediction method based on an affinemotion is applied to a current block will be determined.

When an inter-prediction method based on an affine motion is applied toa current block, an affine motion model for the current block may bedetermined S801. An affine motion model may be determined as at leastone of a 6-parameter affine motion model or a 4-parameter affine motionmodel. The 6-parameter affine motion model expresses an affine motion byusing 6 parameters and the 4-parameter affine motion model expresses anaffine motion by using 4 parameters.

Equation 1 expresses an affine motion by using 6 parameters. An affinemotion represents translation motion for a predetermined regiondetermined by affine seed vectors.

v _(x) =ax−by+e

v=cx+dy+f  [Equation 1]

In case of expressing an affine motion by using 6 parameters,complicated motion may be expressed, but encoding efficiency may bereduced as more bits are needed to encode each parameter. Accordingly,an affine motion may be expressed by using 4 parameters. Equation 2expresses an affine motion by using 4 parameters.

v _(x) =ax−by+e

v _(y) =bx+ay+f  [Equation 2]

Information for determining an affine motion model of a current blockmay be encoded and signaled in a bitstream. In an example, theinformation may be a 1-bit flag, ‘affine_type_flag’. If the value of theflag is 0, it may represent that a 4-parameter affine motion model isapplied and if the value of the flag is 1, it may represent that a6-parameter affine motion model is applied. The flag may be encoded in aunit of a slice, a tile, or a block (e.g. a coding block or a codingtree unit). When a flag is signaled at a slice level, an affine motionmodel determined at the slice level may be applied to all blocksbelonging to the slice.

Alternatively, based on an affine inter-prediction mode of a currentblock, an affine motion model of the current block may be determined. Inan example, when an affine merge mode is applied, an affine motion modelof a current block may be determined as a 4-parameter motion model. Onthe other hand, when an affine motion vector prediction mode is applied,information for determining an affine motion model of a current blockmay be encoded and signaled in a bitstream. In an example, when anaffine motion vector prediction mode is applied to a current block, anaffine motion model of the current block may be determined based on a1-bit flag, ‘affine_type_flag’.

Next, affine seed vectors of a current block may be derived S802. When a4-parameter affine motion model is selected, motion vectors at twocontrol points for a current block may be derived. On the other hand,when a 6-parameter affine motion model is selected, motion vectors atthree control points for a current block may be derived. A motion vectorat a control point may be referred to as an affine seed vector. Acontrol point may include at least one of a left-top corner, a right-topcorner or a left-bottom corner of a current block.

FIG. 9 is a diagram illustrating affine seed vectors for each affinemotion model.

In a 4-parameter affine motion model, affine seed vectors for two amonga left-top corner, a right-top corner or a left-bottom corner may bederived. In an example, as in an example shown in FIG. 9 (a), when a4-parameter affine motion model is selected, an affine vector may bederived by using an affine seed vector sv0 for a left-top corner of acurrent block (e.g. a left-top sample (x1, y1)) and an affine seedvector sv1 for a right-top corner of the current block (e.g. a right-topsample (x1, y1)). It is possible to use an affine seed vector for aleft-bottom corner instead of the affine seed vector for the left-topcorner or use an affine seed vector for a left-bottom corner instead ofthe affine seed vector for the right-top corner.

In a 6-parameter affine motion model, affine seed vectors for a left-topcorner, a right-top corner and a left-bottom corner may be derived. Inan example, as in an example shown in the FIG. 9 (b), when a 6-parameteraffine motion model is selected, an affine vector may be derived byusing an affine seed vector sv0 for a left-top corner of a current block(e.g. a left-top sample (x1, y1)), an affine seed vector sv1 for aright-top corner of the current block (e.g. a right-top sample (x1, y1))and an affine seed vector sv2 for a left-top corner of the current block(e.g. a left-top sample (x2, y2)).

In an embodiment described later, under a 4-parameter affine motionmodel, affine seed vectors at a left-top control point and a right-topcontrol point are referred to as a first affine seed vector and a secondaffine seed vector, respectively. In embodiments described later whichuse the first affine seed vector and the second affine seed vector, atleast one of the first affine seed vector and the second affine seedvector may be replaced with an affine seed vector at a left-bottomcontrol point (a third affine seed vector) or an affine seed vector at aright-bottom control point (a fourth affine seed vector).

In addition, under a 6-parameter affine motion model, affine seedvectors at a left-top control point, a right-top control point and aleft-bottom control point are referred to as a first affine seed vector,a second affine seed vector and a third affine seed vector,respectively. In embodiments described later which use the first affineseed vector, the second affine seed vector and the third affine seedvector, at least one of the first affine seed vector, the second affineseed vector and the third affine seed vector may be replaced with anaffine seed vector at a right-bottom control point (a fourth affine seedvector).

An affine vector may be derived per sub-block by using affine seedvectors S803. In this connection, the affine vector represents atranslation motion vector derived based on the affine seed vectors. Anaffine vector of a sub-block can be referred to as an affine sub-blockmotion vector or a sub-block motion vector.

FIG. 10 is a diagram illustrating affine vectors of sub-blocks under a4-parameter motion model.

An affine vector of a sub-block may be derived based on a position of acontrol point, a position of the sub-block and an affine seed vector. Inan example, Equation 3 represents an example of deriving an affinesub-block motion vector.

$\begin{matrix}{{v_{x} = {{\frac{\left( {{sv_{1x}} - {sv_{0x}}} \right)}{\left( {x_{1} - x_{0}} \right)}\left( {x - x_{0}} \right)} - {\frac{\left( {{sv_{1y}} - {sv_{0y}}} \right)}{\left( {x_{1} - x_{0}} \right)}\left( {y - y_{0}} \right)} + {sv}}}{{v_{y^{=}}\frac{\left( {{sv_{1y}} - {sv_{0y}}} \right)}{\left( {x_{1} - x_{0}} \right)}\left( {x - x_{0}} \right)} - {\frac{\left( {{sv_{1x}} - {sv_{0x}}} \right)}{\left( {x_{1} - x_{0}} \right)}\left( {y - y_{0}} \right)} + {sv_{0y}}}} & \left\lbrack {{Equation}\mspace{14mu} 3} \right\rbrack\end{matrix}$

In the Equation 3, (x, y) represents a position of a sub-block. In thisconnection, the position of the sub-block represents a position of abase sample included in the sub-block. The base sample may be a samplepositioned at a left-top corner of the sub-block or a sample that atleast one of an x-axis or y-axis coordinate is at a central position.(x0, y0) represents a position of a first control point and (sv0x, sv0y)represents a first affine seed vector. In addition, (x1, y1) representsa position of a second control point and (sv1x, sv1y) represents asecond affine seed vector.

When the first control point and the second control point correspond toa left-top corner and a right-top corner of a current block,respectively, x1-x0 may be set as a value identical to a width of thecurrent block.

After that, motion compensation prediction for each sub-block may beperformed by using an affine vector of each sub-block S804. As a resultof performing motion compensation prediction, a prediction block foreach sub-block may be generated. The prediction blocks of sub-blocks maybe set as a prediction block of a current block.

An affine seed vector of a current block may be derived based on anaffine seed vector of a neighboring block neighboring the current block.When an inter-prediction mode of a current block is an affine mergemode, an affine seed vector of a merge candidate included in a mergecandidate list may be determined as an affine seed vector of the currentblock. In addition, when the inter-prediction mode of the current blockis the affine merge mode, motion information including at least one ofthe reference picture index, a specific directional prediction flag or abidirectional weight of the current block may be also set the same asthe merge candidate.

Next, an inter-prediction method using translation motion informationwill be described in detail.

Motion information of a current block may be derived from motioninformation of another block. In this connection, another block may be ablock encoded/decoded by inter prediction previous to the current block.Setting motion information of a current block to be the same as motioninformation of another block may be defined as a merge mode. Also,setting a motion vector of another block as a prediction value of amotion vector of the current block may be defined as a motion vectorprediction mode.

FIG. 11 is a flow diagram of a process deriving the motion informationof a current block under a merge mode.

The merge candidate of a current block may be derived S1101. The mergecandidate of a current block may be derived from a block encoded/decodedby inter-prediction prior to a current block.

FIG. 12 is a diagram illustrating candidate blocks used to derive amerge candidate.

The candidate blocks may include at least one of neighboring blocksincluding a sample adjacent to a current block or non-neighboring blocksincluding a sample non-adjacent to a current block. Hereinafter, samplesdetermining candidate blocks are defined as base samples. In addition, abase sample adjacent to a current block is referred to as a neighboringbase sample and a base sample non-adjacent to a current block isreferred to as a non-neighboring base sample.

A neighboring base sample may be included in a neighboring column of aleftmost column of a current block or a neighboring row of an uppermostrow of a current block. In an example, when the coordinate of a left-topsample of a current block is (0,0), at least one of a block including abase sample at a position of (−1, H−1), (W−1, −1), (W, −1), (−1, H) or(−1, 1) may be used as a candidate block. In reference to a diagram, theneighboring blocks of index 0 to 4 may be used as candidate blocks.

A non-neighboring base sample represents a sample that at least one ofan x-axis distance or a y-axis distance with a base sample adjacent to acurrent block has a predefined value. In an example, at least one of ablock including a base sample that an x-axis distance with a left basesample is a predefined value, a block including a non-neighboring samplethat a y-axis distance with a top base sample is a predefined value or ablock including a non-neighboring sample that a x-axis distance and ay-axis distance with a left-top base sample are a predefined value maybe used as a candidate block. A predefined value may be a natural numbersuch as 4, 8, 12, 16, etc. In reference to a diagram, at least one ofblocks in an index 5 to 26 may be used as a candidate block.

A sample not positioned on the same vertical line, horizontal line ordiagonal line as a neighboring base sample may be set as anon-neighboring base sample.

The motion information of a merge candidate may be set the same as themotion information of a candidate block. In an example, at least one ofa motion vector, a reference picture index, a prediction direction or abidirectional weight index of a candidate block may be set as the motioninformation of a merge candidate.

A merge candidate list including a merge candidate may be generatedS1102.

The index of merge candidates in a merge candidate list may be assignedaccording to the predetermined order. In an example, an index may beassigned in the order of a merge candidate derived from a leftneighboring block, a merge candidate derived from a top neighboringblock, a merge candidate derived from a right-top neighboring block, amerge candidate derived from a left-bottom neighboring block, a mergecandidate derived from a left-top neighboring block and a mergecandidate derived from a temporal neighboring block.

When a plurality of merge candidates are included in a merge candidate,at least one of a plurality of merge candidates may be selected 51103.Concretely, information for specifying any one of a plurality of mergecandidates may be signaled in a bitstream. In an example, information,merge idx, representing an index of any one of merge candidates includedin a merge candidate list may be signaled in a bitstream.

When the number of merge candidates included in a merge candidate listis less than the threshold, a motion information candidate included in amotion information table may be added to a merge candidate list as amerge candidate. In this connection, the threshold may be the maximumnumber of merge candidates which may be included in a merge candidatelist or a value in which an offset is subtracted from the maximum numberof merge candidates. An offset may be a natural number such as 1 or 2,etc.

A motion information table includes a motion information candidatederived from a block encoded/decoded based on inter-prediction in acurrent picture. In an example, the motion information of a motioninformation candidate included in a motion information table may be setthe same as the motion information of a block encoded/decoded based oninter-prediction. In this connection, motion information may include atleast one of a motion vector, a reference picture index, a predictiondirection or a bidirectional weight index.

A motion information candidate included in a motion information tablealso can be referred to as a inter region merge candidate or aprediction region merge candidate.

The maximum number of a motion information candidate which may beincluded in a motion information table may be predefined in an encoderand a decoder. In an example, the maximum number of a motion informationcandidate which may be included in a motion information table may be 1,2, 3, 4, 5, 6, 7, 8 or more (e.g. 16).

Alternatively, information representing the maximum number of a motioninformation candidate which may be included in a motion informationtable may be signaled in a bitstream. The information may be signaled ina sequence, a picture or a slice level. The information may representthe maximum number of a motion information candidate which may beincluded in a motion information table. Alternatively, the informationmay represent difference between the maximum number of a motioninformation candidate which may be included in a motion informationtable and the maximum number of a merge candidate which may be includedin a merge candidate list.

Alternatively, the maximum number of a motion information candidatewhich may be included in a motion information table may be determinedaccording to a picture size, a slice size or a coding tree unit size.

A motion information table may be initialized in a unit of a picture, aslice, a tile, a brick, a coding tree unit or a coding tree unit line (arow or a column). In an example, when a slice is initialized, a motioninformation table is also initialized thus a motion information tablemay not include any motion information candidate.

Alternatively, information representing whether a motion informationtable will be initialized may be signaled in a bitstream. Theinformation may be signaled in a slice, a tile, a brick or a blocklevel. Until the information indicates the initialization of a motioninformation table, a pre-configured motion information table may beused.

Alternatively, information on an initial motion information candidatemay be signaled in a picture parameter set or a slice header. Although aslice is initialized, a motion information table may include an initialmotion information candidate. Accordingly, an initial motion informationcandidate may be used for a block which is the first encoding/decodingtarget in a slice.

Alternatively, a motion information candidate included in the motioninformation table of a previous coding tree unit may be set as aninitial motion information candidate. In an example, a motioninformation candidate with the smallest index or with the largest indexamong motion information candidates included in the motion informationtable of a previous coding tree unit may be set as an initial motioninformation candidate.

Blocks are encoded/decoded in the order of encoding/decoding, and blocksencoded/decoded based on inter-prediction may be sequentially set as amotion information candidate in the order of encoding/decoding.

FIG. 13 is a diagram to explain the update aspect of a motioninformation table.

For a current block, when inter-prediction is performed S1301, a motioninformation candidate may be derived based on a current block S1302. Themotion information of a motion information candidate may be set the sameas that of a current block.

When a motion information table is empty S1303, a motion informationcandidate derived based on a current block may be added to a motioninformation table S1304.

When a motion information table already includes a motion informationcandidate S1303, a redundancy check for the motion information of acurrent block (or, a motion information candidate derived based on it)may be performed S1305. A redundancy check is to determine whether themotion information of a pre-stored motion information candidate in amotion information table is the same as the motion information of acurrent block. A redundancy check may be performed for all pre-storedmotion information candidates in a motion information table.Alternatively, a redundancy check may be performed for motioninformation candidates with an index over or below the threshold amongpre-stored motion information candidates in a motion information table.Alternatively, a redundancy check may be performed for the predefinednumber of motion information candidates. In an example, 2 motioninformation candidates with smallest indexes or with largest indexes maybe determined as targets for a redundancy check.

When a motion information candidate with the same motion information asa current block is not included, a motion information candidate derivedbased on a current block may be added to a motion information tableS1308. Whether motion information candidates are identical may bedetermined based on whether the motion information (e.g. a motionvector/a reference picture index, etc.) of motion information candidatesis identical.

In this connection, when the maximum number of motion informationcandidates are already stored in a motion information table S1306, theoldest motion information candidate may be deleted S1307 and a motioninformation candidate derived based on a current block may be added to amotion information table S1308. In this connection, the oldest motioninformation candidate may be a motion information candidate with thelargest or the smallest index.

Motion information candidates may be identified by respective index.When a motion information candidate derived from a current block isadded to a motion information table, the smallest index (e.g. 0) may beassigned to the motion information candidate and indexes of pre-storedmotion information candidates may be increased by 1. In this connection,When the maximum number of motion information candidates are alreadystored in a motion information table, a motion information candidatewith the largest index is removed.

Alternatively, when a motion information candidate derived from acurrent block is added to a motion information table, the largest indexmay be assigned to the motion information candidate. In an example, whenthe number of pre-stored motion information candidates in a motioninformation table is less than the maximum value, an index with the samevalue as the number of pre-stored motion information candidates may beassigned to the motion information candidate. Alternatively, when thenumber of pre-stored motion information candidates in a motioninformation table is equal to the maximum value, an index subtracting 1from the maximum value may be assigned to the motion informationcandidate. Alternatively, a motion information candidate with thesmallest index is removed and the indexes of residual pre-stored motioninformation candidates are decreased by 1.

FIG. 14 is a diagram showing the update aspect of a motion informationtable.

It is assumed that as a motion information candidate derived from acurrent block is added to a motion information table, the largest indexis assigned to the motion information candidate. In addition, it isassumed that the maximum number of a motion information candidate isalready stored in a motion information table.

When a motion information candidate HmvpCand[n+1] derived from a currentblock is added to a motion information table HmvpCandList, a motioninformation candidate HmvpCand[0] with the smallest index amongpre-stored motion information candidates may be deleted and indexes ofresidual motion information candidates may be decreased by 1. Inaddition, the index of a motion information candidate HmvpCand[n+1]derived from a current block may be set to the maximum value (for anexample shown in FIG. 14, n).

When a motion information candidate identical to a motion informationcandidate derived based on a current block is prestored S1305, a motioninformation candidate derived based on a current block may not be addedto a motion information table S1309.

Alternatively, while a motion information candidate derived based on acurrent block is added to a motion information table, a pre-storedmotion information candidate identical to the motion informationcandidate may be removed. In this case, it causes the same effect aswhen the index of a pre-stored motion information candidate is newlyupdated.

FIG. 15 is a diagram showing an example in which the index of apre-stored motion information candidate is updated.

When the index of a pre-stored motion information candidate identical toa motion information candidate mvCand derived from a current block ishIdx, the pre-stored motion information candidate may be removed and theindex of motion information candidates with an index larger than hIdxmay be decreased by 1. In an example, an example shown in FIG. 15 showedthat HmvpCand[2] identical to mvCand is deleted in a motion informationtable HvmpCandList and an index from HmvpCand[3] to HmvpCand[n] isdecreased by 1.

And, a motion information candidate mvCand derived based on a currentblock may be added to the end of a motion information table.

Alternatively, an index assigned to a pre-stored motion informationcandidate identical to a motion information candidate derived based on acurrent block may be updated. For example, the index of a pre-storedmotion information candidate may be changed to the minimum value or themaximum value.

The motion information of blocks included in a predetermined region maybe set not to be added to a motion information table. In an example, amotion information candidate derived based on the motion information ofa block included in a merge processing region may not be added to amotion information table. Since the encoding/decoding order for blocksincluded in a merge processing region is not defined, it is improper touse motion information of any one of them for the inter-prediction ofanother of them. Accordingly, motion information candidates derivedbased on blocks included in a merge processing region may not be addedto a motion information table.

Alternatively, the motion information of a block smaller than a presetsize may be set not to be added to a motion information table. In anexample, a motion information candidate derived based on the motioninformation of a coding block whose width or height is smaller than 4 or8 or the motion information of a 4×4 sized coding block may not be addedto a motion information table.

Based on the inter-prediction mode of a current block, it may bedetermined whether a current block will be used as a motion informationcandidate. In an example, a block encoded/decoded based on an affinemotion model may be set to be unavailable as a motion informationcandidate. Accordingly, although a current block is encoded/decoded byinter-prediction, a motion information table may not be updated based ona current block when the inter-prediction mode of a current block is anaffine prediction mode.

A motion information candidate may be set to include additionalinformation except for motion information. In an example, at least oneof the size, shape or partition information of a block may beadditionally stored in a motion information candidate. When the mergecandidate list of a current block is configured, only motion informationcandidate whose size, shape or partition information is identical orsimilar to a current block among motion information candidates may beused or a motion information candidate whose size, shape or partitioninformation is identical or similar to a current block may be added to amerge candidate list in advance.

When the number of a merge candidate included in the merge candidatelist of a current block is less than the threshold, a motion informationcandidate included in a motion information table may be added to a mergecandidate list as a merge candidate. The additional process is performedin the order reflecting sorted order of indexes of motion informationcandidates in ascending or descending order. In an example, a motioninformation candidate with the largest index may be first added to themerge candidate list of a current block.

When a motion information candidate included in a motion informationtable is added to a merge candidate list, a redundancy check between amotion information candidate and pre-stored merge candidates in themerge candidate list may be performed. As a result of a redundancycheck, a motion information candidate with the same motion informationas a pre-stored merge candidate may not be added to the merge candidatelist.

A redundancy check may be performed only for a part of motioninformation candidates included in a motion information table. In anexample, a redundancy check may be performed only for a motioninformation candidate with an index over or below the threshold.Alternatively, a redundancy check may be performed only for N motioninformation candidates with the largest index or the smallest index.

Alternatively, a redundancy check may be performed only for a part ofpre-stored merge candidates in a merge candidate list. In an example, aredundancy check may be performed only for a merge candidate whose indexis over or below the threshold or a merge candidate derived from a blockat a specific position. In this connection, a specific position mayinclude at least one of the left neighboring block, the top neighboringblock, the right-top neighboring block or the left-bottom neighboringblock of a current block.

FIG. 16 is a diagram showing an example in which a redundancy check isperformed only for a part of merge candidates.

When a motion information candidate HmvpCand[j] is added to a mergecandidate list, a redundancy check with 2 merge candidates with thelargest index, mergeCandList[NumMerge−2] and mergeCandList[NumMerge−1],may be performed for a motion information candidate. In this connection,NumMerge may show the number of an available spatial merge candidate anda temporal merge candidate.

Unlike a shown example, when a motion information candidate HmvpCand[j]is added to a merge candidate list, a redundancy check with 2 mergecandidates with the smallest index may be performed for a motioninformation candidate. For example, it may be checked whethermergeCandList[0] and mergeCandList[1] are identical to HmvpCand[j].

Alternatively, a redundancy check may be performed only for a mergecandidate derived from a specific position. In an example, a redundancycheck may be performed for at least one of a merge candidate derivedfrom a neighboring block positioned at the left of a current block or atthe top of a current block. When there is no merge candidate derivedfrom a specific position in a merge candidate list, a motion informationcandidate may be added to a merge candidate list without a redundancycheck.

When a motion information candidate HmvpCand[j] is added to a mergecandidate list, a redundancy check with 2 merge candidates with thelargest index, mergeCandList[NumMerge−2] and mergeCandList[NumMerge−1],may be performed for a motion information candidate. In this connection,NumMerge may show the number of an available spatial merge candidate anda temporal merge candidate.

A redundancy check with a merge candidate may be performed only for apart of motion information candidates. In an example, a redundancy checkmay be performed only for N motion information candidates with a largeor a small index among motion information candidates included in amotion information table. In an example, a redundancy check may beperformed only for motion information candidates with an index that thenumber and difference of motion information candidates included in amotion information table are below the threshold. When the threshold is2, a redundancy check may be performed only for 3 motion informationcandidates with the largest index value among motion informationcandidates included in a motion information table. A redundancy checkmay be omitted for motion information candidates except for the above 3motion information candidates. When a redundancy check is omitted, amotion information candidate may be added to a merge candidate listregardless of whether the same motion information as a merge candidateis exist or not.

Conversely, a redundancy check is set to be performed only for motioninformation candidates with an index that the number and difference ofmotion information candidates included in a motion information table areover the threshold.

The number of a motion information candidate that a redundancy check isperformed may be redefined in an encoder and a decoder. In an example,the threshold may be an integer such as 0, 1 or 2.

Alternatively, the threshold may be determined based on at least one ofthe number of a merge candidate included in a merge candidate list orthe number of motion information candidates included in a motioninformation table.

When a merge candidate identical to the first motion informationcandidate is found, a redundancy check with the merge candidateidentical to the first motion information candidate may be omitted in aredundancy check for the second motion information candidate.

FIG. 17 is a diagram showing an example in which a redundancy check witha specific merge candidate is omitted.

When a motion information candidate HmvpCand[i] whose index is i isadded to a merge candidate list, a redundancy check between the motioninformation candidate and pre-stored merge candidates in a mergecandidate list is performed. In this connection, when a merge candidatemergeCandlist[j] identical to a motion information candidate HmvpCand[i]is found, a redundancy check between a motion information candidateHmvpCand[i−1] whose index is i−1 and merge candidates may be performedwithout adding the motion information candidate HmvpCand[i] to a mergecandidate list. In this connection, a redundancy check between themotion information candidate HmvpCand[i−1] and the merge candidatemergeCandList[j] may be omitted.

In an example, in an example shown in FIG. 17, it was determined thatHmvpCand[i] and mergeCandList[2] are identical. Accordingly, aredundancy check for HmvpCand[i−1] may be performed without addingHmvpCand[i] to a merge candidate list. In this connection, a redundancycheck between HmvpCand[i−1] and mergeCandList[2] may be omitted.

When the number of a merge candidate included in the merge candidatelist of a current block is less than the threshold, at least one of apairwise merge candidate or a zero merge candidate may be additionallyincluded except for a motion information candidate. A pairwise mergecandidate means a merge candidate having a value obtained from averagingthe motion vectors of more than 2 merge candidates as a motion vectorand a zero merge candidate means a merge candidate whose motion vectoris 0.

For the merge candidate list of a current block, a merge candidate maybe added in the following order.

Spatial merge candidate-Temporal merge candidate-Motion informationcandidate-(Affine motion information candidate)-Pairwise mergecandidate-Zero merge candidate

A spatial merge candidate means a merge candidate derived from at leastone of a neighboring block or a non-neighboring block and a temporalmerge candidate means a merge candidate derived from a previousreference picture. An affine motion information candidate represents amotion information candidate derived from a block encoded/decoded by anaffine motion model.

A motion information table may also be used in a motion vectorprediction mode. In an example, when the number of a motion vectorprediction candidate included in the motion vector prediction candidatelist of a current block is less than the threshold, a motion informationcandidate included in a motion information table may be set as a motionvector prediction candidate for a current block. Concretely, the motionvector of a motion information candidate may be set as a motion vectorprediction candidate.

If any one of motion vector prediction candidates included in the motionvector prediction candidate list of a current block is selected, aselected candidate may be set as a motion vector predictor of a currentblock. Then, after the motion vector residual value of a current blockis decoded, the motion vector of a current block may be obtained byadding up the motion vector predictor and the motion vector residualvalue.

The motion vector prediction candidate list of a current block may beconfigured in the following order.

Spatial motion vector prediction candidate-Temporal motion vectorprediction candidate-Motion information candidate-(Affine motioninformation candidate)-Zero motion vector prediction candidate

A spatial motion vector prediction candidate means a motion vectorprediction candidate derived from at least one of a neighboring block ora non-neighboring block and a temporal motion vector predictioncandidate means a motion vector prediction candidate derived from aprevious reference picture. An affine motion information candidaterepresents a motion information candidate derived from a blockencoded/decoded by an affine motion model. A zero motion vectorprediction candidate represents a candidate that the value of a motionvector is 0.

A merge processing region larger than a coding block may be defined.Coding blocks included in a merge processing region may be processed inparallel without being sequentially encoded/decoded. In this connection,not being sequentially encoded/decoded means the order ofencoding/decoding is not defined. Accordingly, the encoding/decodingprocess of blocks included in a merge processing region may beindependently processed. Alternatively, blocks included in a mergeprocessing region may share merge candidates. In this connection, themerge candidates may be derived based on a merge processing region.

According to the above-mentioned feature, a merge processing region maybe referred to as a parallel processing region, a shared merge region(SMR) or a merge estimation region (MER).

A merge candidate of a current block may be derived based on a codingblock. But, when a current block is included in a merge processingregion larger than the current block, a candidate block included in thesame merge processing region as the current block may be set to beunavailable as a merge candidate.

FIG. 18 is a diagram showing an example in which a candidate blockincluded in the same merge processing region as a current block is setto be unavailable as a merge candidate.

In an example shown in FIG. 18 (a), in the decoding/decoding of CU5,blocks including base samples adjacent to CU5 may be set as candidateblocks. In this connection, candidate blocks X3 and X4 included in thesame merge processing region as CU5 may be set to be unavailable as amerge candidate of CU5. But, candidate blocks X0, X1 and X2 not includedin the same merge processing region as CU5 may be set to be available asa merge candidate.

In an example shown in FIG. 18 (b), in the decoding/decoding of CU8,blocks including base samples adjacent to CU8 may be set as candidateblocks. In this connection, candidate blocks X6, X7 and X8 included inthe same merge processing region as CU8 may be set to be unavailable asa merge candidate. But, candidate blocks X5 and X9 not included in thesame merge processing region as CU8 may be set to be available as amerge candidate.

Alternatively, when a current block is included in a merge processingregion, a neighboring block adjacent to a current block and to a mergeprocessing region may be set as a candidate block.

FIG. 19 is a diagram showing an example which derives a merge candidatefor a current block when a current block is included in a mergeprocessing region.

As in an example shown in FIG. 19 (a), neighboring blocks adjacent to acurrent block may be set as candidate blocks for deriving the mergecandidate of the current block. In this connection, a candidate blockincluded in the same merge processing region as the current block may beset to be unavailable as a merge candidate. In an example, in deriving amerge candidate for a coding block CU3, a top neighboring block y3 and aright-top neighboring block y4 included in the same merge processingregion as the coding block CU3 may be set to be unavailable as a mergecandidate of the coding block CU3.

By scanning neighboring blocks adjacent to a current block in thepredefined order, a merge candidate may be derived. In an example, thepredefined order may be the order of y1, y3, y4, y0 and y2.

When the number of merge candidates which may be derived fromneighboring blocks adjacent to a current block is less than a value thatan offset is subtracted from the maximum number of merge candidates orthe maximum number, a merge candidate for the current block may bederived by using neighboring blocks adjacent to a merge processingregion like an example shown in FIG. 19 (b). In an example, neighboringblocks adjacent to a merge processing region including a coding blockCU3 may be set as candidate blocks for the coding block CU3. In thisconnection, neighboring blocks adjacent to a merge processing region mayinclude at least one of a left neighboring block x1, a top neighboringblock x3, a left-bottom neighboring block x0, a right-top neighboringblock x4 or a left-top neighboring block x2.

By scanning neighboring blocks adjacent to a merge processing region inthe predefined order, a merge candidate may be derived. In an example,the predefined order may be the order of x1, x3, x4, x0 and x2.

In summary, a merge candidate on the coding block CU3 including in amerge processing region may be derived by scanning candidate blocks inthe following scanning order.

(y1, y3, y4, y0, y2, x1, x3, x4, x0, x2)

But, the scanning order of the above-illustrated candidate blocks onlyshows the example of the present disclosure and candidate blocks may bescanned in the order different from the above example. Alternatively,the scanning order may be adaptively determined based on at least one ofa size or a shape of a current block or a merge processing region.

A merge processing region may be square or non-square. Information fordetermining a merge processing region may be signaled in a bitstream.The information may include at least one of information representing theshape of a merge processing region or information representing the sizeof a merge processing region. When a merge processing region isnon-square, at least one of information representing the size of a mergeprocessing region, information representing the width or height of amerge processing region or information representing a ratio between thewidth and height of a merge processing region may be signaled in abitstream.

The size of a merge processing region may be determined based on atleast one of information signaled in a bitstream, picture resolution,the size of a slice or the size of a tile.

If motion compensation prediction is performed for a block included in amerge processing region, a motion information candidate derived based onthe motion information of a block in which motion compensationprediction is performed may be added to a motion information table.

But, if a motion information candidate derived from a block included ina merge processing region is added to a motion information table, a casemay occur where a motion information candidate derived from the block isused in the encoding/decoding of other block in the merge processingregion whose encoding/decoding is actually slower than the block. Inother words, although dependence between blocks should be excluded inthe encoding/decoding of blocks included in a merge processing region, acase may occur where motion prediction compensation is performed byusing the motion information of other block included in the mergeprocessing region. To solve such a problem, although theencoding/decoding of a block included in a merge processing region iscompleted, the motion information of the block whose encoding/decodingis completed may not be added to a motion information table.

Alternatively, the motion information table may be updated using only ablock at a predefined position within a merge processing region. Theexamples of the predefined position may include at least one of a blockpositioned on the top left of the merge processing region, a blockpositioned on the top right of the merge processing region, a blockpositioned on the bottom left of the merge processing region, a blockpositioned on the bottom right of the merge processing region, a blockpositioned in the center of the merge processing region, a blockadjacent to the right boundary of the merge processing region, and ablock adjacent to the bottom boundary of the merge processing region. Asan example, the motion information table may be updated only with motioninformation of a block adjacent to the bottom right corner of the mergeprocessing region and the motion information table may not be updatedwith motion information of other blocks.

Alternatively, after decoding of all blocks included in the mergeprocessing region is completed, a motion information candidate derivedfrom the blocks may be added to the motion information table. That is,while the blocks included in the merge processing region areencoded/decoded, the motion information table may not be updated.

In an example, if motion compensation prediction is performed for blocksincluded in a merge processing region, a motion information candidatederived from the blocks may be added to a motion information table inthe predefined order. In this connection, the predefined order may bedetermined in the scanning order of coding blocks in a merge processingregion or a coding tree unit. The scanning order may be at least one ofraster scanning, horizontal scanning, vertical scanning or zigzagscanning. Alternatively, the predefined order may be determined based onthe motion information of each block or the number of blocks with thesame motion information.

Alternatively, a motion information candidate including a unidirectionalmotion information may be added to a motion information table before amotion information candidate including a bidirectional motioninformation. On the contrary, a motion information candidate including abidirectional motion information may be added to a motion informationtable before a motion information candidate including a unidirectionalmotion information.

Alternatively, a motion information candidate may be added to a motioninformation table in the order of high frequency of use or low frequencyof use in a merge processing region or a coding tree unit.

When a current block is included in a merge processing region and thenumber of merge candidates included in a merge candidate list of thecurrent block is less than the maximum number, a motion informationcandidate included in a motion information table may be added to themerge candidate list. In this connection, a motion information candidatederived from a block included in the same merge processing region as acurrent block may be set not to be added to the merge candidate list ofthe current block.

Alternatively, when a current block is included in a merge processingregion, it may be set not to use a motion information candidate includedin a motion information table. In other words, although the number ofmerge candidates included in a merge candidate list of the current blockis less than the maximum number, a motion information candidate includedin a motion information table may not be added to the merge candidatelist.

In another example, a motion information table on a merge processingregion or a coding tree unit may be configured. This motion informationtable plays a role of temporarily storing the motion information ofblocks included in a merge processing region. To distinguish between ageneral motion information table and a motion information table for amerge processing region or a coding tree unit, the motion informationtable for the merge processing region or the coding tree unit isreferred to as a temporary motion information table. And, a motioninformation candidate stored in the temporary motion information tableis referred to as a temporary motion information candidate.

FIG. 20 is a diagram showing a temporary motion information table.

A temporary motion information table for a coding tree unit or a mergeprocessing region may be configured. When motion compensation predictionis performed for a current block included in a coding tree unit or amerge processing region, the motion information of the block may not beadded to a motion information table HmvpCandList. Instead, a temporarymotion information candidate derived from the block may be added to atemporary motion information table HmvpMERCandList. In other words, atemporary motion information candidate added to a temporary motioninformation table may not be added to a motion information table.Accordingly, a motion information table may not include a motioninformation candidate derived based on motion information of blocksincluded in a coding tree unit or a merge processing region including acurrent block.

Alternatively, only motion information of some of the blocks included inthe merge processing region may be added to the temporary motioninformation table. As an example, only blocks at predefined positionswithin the merge processing region may be used for updating the motioninformation table. The predefined positions may include at least one ofa block positioned on the top left of the merge processing region, ablock positioned on the top right of the merge processing region, ablock positioned on the bottom left of the merge processing region, ablock positioned on the bottom right of the merge processing region, ablock positioned in the center of the merge processing region, a blockadjacent to the right boundary of the merge processing region, and ablock adjacent to the bottom boundary of the merge processing region. Asan example, only motion information of a block adjacent to the bottomright corner of the merge processing region may be added to thetemporary motion information table and motion information of otherblocks may not be added to the temporary motion information table.

The maximum number of temporary motion information candidates that thetemporary motion information table is able to include may be set equalto the maximum number of motion information candidates that the motioninformation table is able to include. Alternatively, the maximum numberof temporary motion information candidates that the temporary motioninformation table is able to include may be determined according to thesize of the coding tree unit or the merge processing region.Alternatively, the maximum number of temporary motion informationcandidates that the temporary motion information table is able toinclude may be set smaller than the maximum number of motion informationcandidates that the motion information table is able to include.

A current block included in a coding tree unit or a merge processingregion may be set not to use a temporary motion information table on thecorresponding coding tree unit or merge processing region. In otherwords, when the number of merge candidates included in the mergecandidate list of the current block is less than the threshold, a motioninformation candidate included in a motion information table may beadded to the merge candidate list and a temporary motion informationcandidate included in a temporary motion information table may not beadded to the merge candidate list. Accordingly, the motion informationof other block including in the same coding tree unit or the same mergeprocessing region as the current block may not be used for the motioncompensation prediction of the current block.

If the encoding/decoding of all blocks included in a coding tree unit ora merge processing region is completed, a motion information table and atemporary motion information table may be unified.

FIG. 21 is a diagram showing an example in which a motion informationtable and a temporary motion information table are unified.

If the encoding/decoding of all blocks included in a coding tree unit ora merge processing region is completed, a temporary motion informationcandidate included in a temporary motion information table may beupdated in a motion information table as in an example shown in FIG. 21.

In this connection, temporary motion information candidates included ina temporary motion information table may be added to a motioninformation table in the order inserted in the temporary motioninformation table. (In other words, in the ascending order or thedescending order of the index value)

In another example, temporary motion information candidates included ina temporary motion information table may be added to a motioninformation table in the predefined order. In this connection, thepredefined order may be determined in the scanning order of codingblocks in a merge processing region or a coding tree unit. The scanningorder may be at least one of raster scanning, horizontal scanning,vertical scanning or zigzag scanning. Alternatively, the predefinedorder may be determined based on the motion information of each block orthe number of blocks with the same motion information.

Alternatively, a temporary motion information candidate including aunidirectional motion information may be added to a motion informationtable before a temporary motion information candidate including abidirectional motion information. On the contrary, a temporary motioninformation candidate including a bidirectional motion information maybe added to a motion information table before a temporary motioninformation candidate including a unidirectional motion information.

Alternatively, a temporary motion information candidate may be added toa motion information table in the order of high frequency of use or lowfrequency of use in a merge processing region or a coding tree unit.

In case that a temporary motion information candidate included in atemporary motion information table is added to a motion informationtable, a redundancy check for a temporary motion information candidatemay be performed. In an example, when the same motion informationcandidate as a temporary motion information candidate included in atemporary motion information table is prestored in a motion informationtable, the temporary motion information candidate may not be added tothe motion information table. In this connection, a redundancy check maybe performed for a part of motion information candidates included in amotion information table. In an example, a redundancy check may beperformed for motion information candidates with an index over or belowthe threshold. In an example, when a temporary motion informationcandidate is equal to a motion information candidate with an index overthe predefined value, the temporary motion information candidate may notbe added to a motion information table.

It may limit the use of a motion information candidate derived from ablock included in the same coding tree unit or the same merge processingregion as a current block as the merge candidate of the current block.For it, the address information of a block may be additionally storedfor a motion information candidate. The address information of a blockmay include at least one of the position of the block, the address ofthe block, the index of the block, the position of a merge processingregion in which the block is included, the address of a merge processingregion in which the block is included, the index of a merge processingregion in which the block is included, the position of a coding treeregion in which the block is included, the address of a coding treeregion in which the block is included or the index of a coding treeregion in which the block is included.

Intra-prediction predicts a current block by using a reconstructedsample that has been already encoded/decoded and which is around thecurrent block. In this connection, a reconstructed sample beforeapplying an in-loop filter may be used for intra-prediction of thecurrent block.

An intra-prediction method includes intra-prediction based on a matrixand intra-prediction according to a direction with a neighboringreconstruction sample. Information indicating an intra-prediction methodof a current block may be signaled in a bitstream. The information maybe a 1-bit flag.

Alternatively, an intra-prediction of a current block may be determinedon the basis of at least one of a position of the current block, a sizeof the current block, a shape of the current block, or anintra-prediction method of a neighboring block. In an example, when acurrent block is present crossing a picture boundary, it may be set suchthat an intra-prediction method based on a matrix is not applied to thecurrent block.

An intra-prediction method based on a matrix is a method of obtaining aprediction block of a current block on the basis of a matrix product ofa matrix stored in the encoder and the decoder, and reconstructionsamples around the current block. Information for specifying any one ofa plurality of prestored matrices may be signaled in a bitstream. Thedecoder may determine a matrix for performing intra-prediction on acurrent block on the basis of the above information and a size of thecurrent block.

General intra-prediction is a method of obtaining a prediction block ofa current block on the basis of a non-directional intra-prediction modeor directional intra-prediction mode. Hereinafter, with reference tofigures, a process of intra-prediction based on general intra-predictionwill be described in detail.

FIG. 22 is a flow diagram of an intra-prediction method according to anembodiment of the present disclosure.

A reference sample line of a current block may be determined S2201. Thereference sample line means a group of reference samples included in ak-th line apart from a top and/or a left of the current block. Areference sample may be derived from a reconstructed sampleencoded/decoded around the current block.

Index information identifying a reference sample line for a currentblock among a plurality of reference sample lines may be signaled in abitstream. In an example, index information, intra luma ref idx, forspecifying the reference sample line of the current block may besignaled in the bitstream. The index information may be signaled percoding block.

A plurality of reference sample lines may include at least one of afirst line, a second line or a third line at a top and/or left of acurrent block. A reference sample line composed of a row adjacent to thetop of the current block and a column adjacent to the left of thecurrent block among a plurality of reference sample lines may bereferred to as an adjacent reference sample line, and other referencesample lines may be referred to as a non-adjacent reference sample line.

Table 1 shows an index assigned to each candidate reference sample line.

TABLE 1 Index (intra_luma_ref_idx) Reference sample line 0 Adjacentreference sample line 1 First non-adjacent reference sample line 2Second non-adjacent reference sample line

Based on at least one of a position, a size, a shape of a current blockor a prediction encoding mode of a neighboring block, a reference sampleline of the current block may be determined. In one example, when thecurrent block adjoins a boundary of a picture, a tile, a slice or acoding tree unit, an adjacent reference sample line may be determined asthe reference sample line of the current block.

A reference sample line may include top reference samples positioned ata top of the current block and left reference samples positioned at aleft of the current block. The top reference samples and left referencesamples may be derived from reconstructed samples around the currentblock. The reconstructed samples may be in a state before an in-loopfilter is applied.

Next, an intra-prediction mode of a current block may be determined52202. For the intra-prediction mode of the current block, at least oneof a non-directional intra-prediction mode or a directionalintra-prediction mode may be determined as the intra-prediction mode ofthe current block. Non-directional intra-prediction modes includes aplanar and a DC and directional intra-prediction modes includes 33 or 65modes from a left-bottom diagonal direction to a right-top diagonaldirection.

FIG. 23 is a diagram showing intra-prediction modes.

FIG. 23 (a) shows 35 intra-prediction modes and FIG. 23 (b) shows 67intra-prediction modes.

The larger or smaller number of intra-prediction modes than shown inFIG. 23 may be defined.

Based on an intra-prediction mode of a neighboring block adjacent to acurrent block, an MPM (Most Probable Mode) may be set. In thisconnection, a neighboring block may include a left neighboring blockadjacent to a left of the current block and a top neighboring blockadjacent to a top of the current block.

The number of MPMs included in an MPM list may be preset in an encoderand a decoder. In an example, the number of MPMs may be 3, 4, 5 or 6.Alternatively, information representing the number of MPMs may besignaled in a bitstream. Alternatively, based on at least one of aprediction encoding mode of a neighboring block, a size, a shape or areference sample line index of a current block, the number of MPMs maybe determined. In an example, while N MPMs may be used when an adjacentreference sample line is determined as the reference sample line of thecurrent block, M MPMs may be used when a non-adjacent reference sampleline is determined as the reference sample line of the current block. AsM is a natural number smaller than N, in an example, N may be 6 and Mmay be 5, 4 or 3. Accordingly, while the intra-prediction mode of thecurrent block may be determined as any one of 6 candidateintra-prediction modes when the index of the reference sample line ofthe current block is 0 and an MPM flag is true, the intra-predictionmode of the current block may be determined as any one of 5 candidateintra-prediction modes when the index of the reference sample line ofthe current block is larger than 0 and an MPM flag is true.

Alternatively, the fixed number (e.g. 6 or 5) of MPM candidates may beused regardless of the index of the reference sample line of the currentblock.

An MPM list including a plurality of MPMs may be generated andinformation indicating whether the same MPM as an intra-prediction modeof a current block is included in the MPM list may be signaled in abitstream. As the information is a 1-bit flag, it may be referred to asan MPM flag. When the MPM flag represents the same MPM as the currentblock is included in the MPM list, index information identifying one ofMPMs may be signaled in a bitstream. In an example, index information,mpm idx, specifying any one of plural MPMs may be signaled in abitstream. An MPM specified by the index information may be set as theintra-prediction mode of the current block. When the MPM flag representsthe same MPM as the current block is not included in the MPM list,remaining mode information indicating any one of remainingintra-prediction modes except for MPMs may be signaled in a bitstream.Remaining mode information represents an index value corresponding tothe intra-prediction mode of the current block when an index isreassigned to remaining intra-prediction modes except for MPMs. Adecoder may determine the intra-prediction mode of the current block byarranging MPMs in the ascending order and comparing remaining modeinformation with MPMs. In an example, when remaining mode information isequal to or smaller than MPM, the intra-prediction mode of the currentblock may be derived by adding 1 to remaining mode information.

In deriving an intra-prediction mode of a current block, comparing apart of MPMs with remaining mode information may be omitted. In anexample, MPMs in a non-directional intra-prediction mode among MPMs maybe excluded from a comparison target. When non-directionalintra-prediction modes are set as MPMs, remaining mode informationclearly indicates a directional intra-prediction mode, so theintra-prediction mode of the current block may be derived by comparingremaining MPMs except for non-directional intra-prediction modes withremaining mode information. Instead of excluding non-directionalintra-prediction modes from a comparison target, a result value may becompared with remaining MPMs after adding the number of non-directionalintra-prediction modes to remaining mode information.

Instead of setting a default mode as an MPM, information indicatingwhether an intra-prediction mode of a current block is the default modemay be signaled in a bitstream. The information is a 1-bit flag and theflag may be referred to as a default mode flag. The default mode flagmay be signaled only when an MPM flag represents that the same MPM asthe current block is included in an MPM list. As described above, thedefault mode may include at least one of a planar, DC, a verticaldirection mode or a horizontal direction mode. In an example, when theplanar is set as the default mode, the default mode flag may indicatewhether the intra-prediction mode of the current block is the planar.When the default mode flag indicates that the intra-prediction mode ofthe current block is not the default mode, one of MPMs indicated byindex information may be set as the intra-prediction mode of the currentblock.

When a default mode flag is used, it may be set that an intra-predictionmode same with a default mode is not set as an MPM. In an example, whenthe default mode flag indicates that whether the intra-prediction modeof the current block is a planar, the intra-prediction mode of thecurrent block may be derived by using 5 MPMs excluding an MPMcorresponding to the planar.

When a plurality of intra-prediction modes are set as default modes,index information indicating any one of default modes may be furthersignaled. The intra-prediction mode of the current block may be set as adefault mode indicated by the index information.

When an index of a reference sample line of a current block is not 0, itmay be set not to use a default mode. In an example, when a non-adjacentreference sample line is determined as the reference sample line of thecurrent block, it may be set not to use a non-directionalintra-prediction mode such as a DC mode or a planar mode. Accordingly,when an index of a reference sample line is not 0, a default mode flagmay not be signaled and a value of the default mode flag may be inferredto a predefined value (i.e. false).

When an intra-prediction mode of a current block is determined,prediction samples for the current block may be obtained based on adetermined intra-prediction mode S2203.

When the DC mode is selected, prediction samples for the current blockmay be generated based on an average value of the reference samples. Indetail, values of all of samples within the prediction block may begenerated based on an average value of the reference samples. An averagevalue may be derived using at least one of top reference samplesadjacent to the top of the current block, and left reference samplesadjacent to the left of the current block.

The number or a range of the reference samples used when deriving anaverage value may vary based on the shape of the current block. In anexample, when a current block is a non-square block where a width isgreater than a height, an average value may be calculated by using topreference samples. To the contrary, when a current block is a non-squareblock where a width is smaller than a height, an average value may becalculated by using left reference samples. In other words, when a widthand a height of the current block are different, reference samplesadjacent to the greater length may be used so as to calculate an averagevalue. Alternatively, whether to calculate an average value by using topreference samples or by using left reference samples may be determinedon the basis of a ratio between a width and a height of the currentblock.

When a planar mode is selected, a prediction sample may be obtained byusing a horizontal directional prediction sample and a verticaldirectional prediction sample. In this connection, the horizontaldirectional prediction sample may be obtained on the basis of a leftreference sample and a right reference sample which are positioned atthe same horizontal line with the prediction sample, and the verticaldirectional prediction sample may be obtained on the basis of an topreference sample and a bottom reference sample which are positioned atthe same vertical line with the prediction sample. In this connection,the right reference sample may be generated by copying a referencesample adjacent to the top-right corner of the current block, and thebottom reference sample may be generated by copying a reference sampleadjacent to the lower-left corner of the current block. The horizontaldirectional prediction sample may be obtained on the basis of a weightedsum of the left reference sample and the right reference sample, and thevertical directional prediction sample may be obtained on the basis of aweighted sum of the top reference sample and the bottom referencesample. In this connection, a weighting factor assigned to eachreference sample may be determined according to a position of theprediction sample. The prediction sample may be obtained on the basis ofan average or a weighted sum of the horizontal directional predictionsample and the vertical directional prediction sample. When a weightedsum is used, a weighting factor assigned to the horizontal directionalprediction sample and the vertical directional prediction sample may bedetermined on the basis of a position of the prediction sample.

When a directional prediction mode is selected, a parameter representinga prediction direction (or prediction angle) of the selected directionalprediction mode may be determined. Table 2 below represents an intradirectional parameter of intraPredAng for each intra-prediction mode.

TABLE 2 PredModeIntra 1 2 3 4 5 6 7 IntraPredAng — 32 26 21 17 13 9PredModeIntra 8 9 10 11 12 13 14 IntraPredAng 5 2 0 −2 −5 −9 −13PredModeIntra 15 16 17 18 19 20 21 IntraPredAng −17 −21 −26 −32 −26 −21−17 PredModeIntra 22 23 24 25 26 27 28 IntraPredAng −13 −9 −5 −2 0 2 5PredModeIntra 29 30 31 32 33 34 IntraPredAng 9 13 17 21 26 32

Table 2 represents an intra directional parameter of eachintra-prediction mode where an index thereof is one of 2 to 34 when 35intra-prediction modes are defined. When directional intra-predictionmodes are defined more than 33, an intra directional parameter of eachintra-prediction mode may be set by subdividing Table 2.

Top reference samples and left reference samples for the current blockare arranged in a line, and then a prediction sample may be obtained onthe basis of a value of an intra directional parameter. In thisconnection, when a value of the intra directional parameter is anegative value, left reference samples and top reference samples may bearranged in a line.

FIGS. 24 and 25 are views respectively showing examples ofone-dimensional arrangement where reference samples are arranged in aline.

FIG. 24 is a view showing vertical directional one-dimensionalarrangement where reference samples are arranged in a verticaldirection, and FIG. 25 is a view showing horizontal directionalone-dimensional arrangement where reference samples are arranged in ahorizontal direction. Examples of FIGS. 24 and 25 will be described inassumption that 35 intra-prediction modes are defined.

When an intra-prediction mode index is any one of 11 to 18, horizontaldirectional one-dimensional arrangement may be applied where topreference samples are rotated in counterclockwise, and when anintra-prediction mode index is any one of 19 to 25, vertical directionalone-dimensional arrangement may be applied where left reference samplesare rotated in clockwise. When arranging reference samples in a line, anintra-prediction mode angle may be considered.

A reference sample determining parameter may be determined on the basisof an intra directional parameter. The reference sample determiningparameter may include a reference sample index for specifying a sample,and a weighting factor parameter for determining a weighting factorapplied to the reference sample.

A reference sample index, iIdx, and a weighting factor parameter, ifact,may be respectively obtained through Equations 4 and 5 below.

iIdx=(y+1)*P _(ang)/32  [Equation 4]

i _(fact)[(y+1)*P _(ang)]&31  [Equation 5]

In Equations 4 and 5, P_(ang) represents an intra directional parameter.A reference sample specified by a reference sample index of iIdxcorresponds to an integer pel.

In order to derive a prediction sample, at least one reference samplemay be specified. In detail, according to a slope of a prediction mode,a position of a reference sample used for deriving a prediction samplemay be specified. In an example, a reference sample used for deriving aprediction sample may be specified by using a reference sample index ofiIdx.

In this connection, when a slope of an intra-prediction mode is notrepresented by one reference sample, a prediction sample may begenerated by performing interpolation on a plurality of referencesamples. In an example, when a slope of an intra-prediction mode is avalue between a slope between a prediction sample and a first referencesample, and a slope between the prediction sample and a second referencesample, the prediction sample may be obtained by performinginterpolation on the first reference sample and the second referencesample. In other words, when an angular line according to anintra-prediction angle does not pass a reference sample positioned at aninteger pel, a prediction sample may be obtained by performinginterpolation on reference samples positioned adjacent to the left andthe right, or the top and the bottom of the position where the angularline passes.

Equation 6 below represents an example of obtaining a prediction sampleon the basis of reference samples.

P(x,y)=((32−i _(fact))/32)*Ref_1D(x+iIdx+1)±(i_(fact)/32)*Ref_1D(x+iIdx+2)

In Equation 6, P represents a prediction sample, and Ref 1D representsany one of reference samples that are arranged in a line. In thisconnection, a position of the reference sample may be determined by aposition (x, y) of the prediction sample and a reference sample index ofiIdx.

When a slope of an intra-prediction mode is possibly represented by onereference sample, a weighting factor parameter of i_(fact) is set to 0.Accordingly, Equation 6 may be simplified as Equation 7 below.

P(x,y)=Ref_1D(x+iIdx+1)  [Equation 7]

Intra-prediction for a current block may be performed on the basis of aplurality of intra-prediction modes. In an example, an intra-predictionmode may be derived for each prediction sample, and a prediction samplemay be derived on the basis of an intra-prediction mode assigned to eachprediction sample.

Alternatively, an intra-prediction mode may be derived for each region,intra-prediction for each region may be performed on the basis of anintra-prediction mode assigned to each region. In this connection, theregion may include at least one sample. At least one of a size and ashape of the region may be adaptively determined on the basis of atleast one of a size of the current block, a shape of the current block,and an intra-prediction mode for the current block. Alternatively, atleast one of a size and a shape of the region may be predefined in theencoder and the decoder independent to a size or shape of the currentblock.

FIG. 26 is a view showing a degree formed between directionalintra-prediction modes and a straight line parallel to an x axis.

As an example shown in FIG. 26, directional prediction modes may bepresent between the lower-left diagonal direction and the top-rightdiagonal direction. Describing a degree formed between the x axis and adirectional prediction mode, directional prediction modes may be presentfrom 45 degrees (bottom-left diagonal direction) to −135 degrees(top-right diagonal direction).

When a current block is a non-square, a case may be present where aprediction sample is derived by using, among reference samplespositioned at the angular line according to an intra-prediction angle, areference sample that is positioned farther than a reference sampleclose to a prediction sample according to an intra-prediction mode forthe current block.

FIG. 27 is a view shown an aspect of obtaining a prediction sample whena current block is a non-square.

In an example, as an example shown in FIG. 27 (a), it is assumed that acurrent block is a non-square where a width is greater than a height,and an intra-prediction mode for the current block is a directionalintra-prediction mode having an angle from 0 degree to 45 degrees. Inthe above case, when deriving a prediction sample A around a rightcolumn of the current block, among reference samples positioned at theangular mode according to the above degree, rather than using a topreference sample T close to the prediction sample, a case may be presentwhere a left reference sample L far away from the prediction sample isused.

In another example, as an example shown in FIG. 27 (b), it is assumedthat a current block is a non-square where a height is greater than awidth, and an intra-prediction mode for the current block is adirectional intra-prediction mode from −90 degrees to −135 degrees. Inthe above case, when deriving a prediction sample A around a bottom rowof the current block, among reference samples positioned at the angularmode according to the above degree, rather than using a left referencesample L close to the prediction sample, a case may be present where atop reference sample T far away from the prediction sample is used.

To solve the above problem, when a current block is a non-square, anintra-prediction mode for the current block may be substituted with anintra-prediction mode in opposite direction. Accordingly, for anon-square block, directional prediction modes having angles greater orsmaller than those of directional prediction modes shown in FIG. 23 maybe used. The above directional intra-prediction mode may be defined as awide angle intra-prediction mode. A wide angle intra-prediction moderepresents a directional intra-prediction mode that does not belong to arange of 45 degrees to −135 degrees.

FIG. 28 is a view showing wide angle intra-prediction modes.

In an example show in FIG. 28, intra-prediction modes having indicesfrom −1 to −14 and intra-prediction modes having indices from 67 to 80represent wide angle intra-prediction modes.

In FIG. 28, 14 wide angle intra-prediction modes (from −1 to −14) whichare greater in angle than 45 degrees and 4 wide angle intra-predictionmodes (from 67 to 80) which are smaller in angle than −135 degrees areshown. However, more or fewer number of wide angle intra-predictionmodes may be defined.

When a wide angle intra-prediction mode is used, a length of topreference samples may be set to 2W+1, and a length of left referencesamples may be set to 2H+1.

By using a wide angle intra-prediction mode, a sample A shown in FIG. 28(a) may be predicted by using a reference sample T, and a sample A shownin FIG. 28 (b) may be predicted by a reference sample L.

In addition to legacy intra-prediction modes and N wide angleintra-prediction modes, a total of 67+N intra-prediction modes may beused. In an example, Table 3 represents an intra directional parameterfor intra-prediction modes when wide angle intra-prediction modes aredefined.

TABLE 3 PredModeIntra −10 −9 −8 −7 −6 −5 −4 −3 −2 intraPredAngle 114 9379 68 60 54 49 45 39 PredModeIntra −1 2 3 4 5 6 7 8 9 intraPredAngle 3532 29 26 23 21 19 17 15 PredModeIntra 10 11 12 13 14 15 16 17 18intraPredAngle 13 11 9 7 5 3 2 1 0 PredModeIntra 19 20 21 22 23 24 25 2627 intraPredAngle −1 −2 −3 −5 −7 −9 −11 −13 −15 PredModeIntra 28 29 3031 32 33 34 35 36 intraPredAngle −17 −19 −21 −23 −26 −29 −32 −29 −26PredModeIntra 37 38 39 40 41 42 43 44 45 intraPredAngle −23 −21 −19 −17−15 −13 −11 −9 −7 PredModeIntra 46 47 48 49 50 51 52 53 54intraPredAngle −5 −3 −2 −1 0 1 2 3 5 PredModeIntra 55 56 57 58 59 60 6162 63 intraPredAngle 7 9 11 13 15 17 19 21 23 PredModeIntra 64 65 66 6768 69 70 71 72 intraPredAngle 26 29 32 35 39 45 49 54 60 PredModeIntra73 74 75 76 intraPredAngle 68 79 93 114

When a current block is a non-square, and an intra-prediction mode forthe current block which is obtained in S2502 belongs to a transformrange, the intra-prediction mode for the current block may betransformed into a wide angle intra-prediction mode. The transform rangemay be determined on the basis of at least one of a size, a shape, or aratio of the current block. In this connection, the ratio may representa ratio between a width and a height of the current block.

When a current block is a non-square where a width is greater than aheight, a transform range may be set from an intra-prediction mode index(for example, 66) of an top-right diagonal direction to (anintra-prediction mode index of the top-right diagonal direction−N). Inthis connection, N may be determined on the basis of a ratio of thecurrent block. When an intra-prediction mode for the current blockbelongs to a transform range, the intra-prediction mode may betransformed into a wide angle intra-prediction mode. The transform maybe subtracting a predefined value from the intra-prediction mode, andthe predefined value may be the total number (for example, 67) ofintra-prediction modes excluding a wide angle intra-prediction mode.

In the above example, intra-prediction mode from the number 66 to thenumber 53 may be respectively transformed into wide angleintra-prediction modes from the number −1 to the number −14.

When a current block is a non-square where a height is greater than awidth, a transform range may be set from an intra-prediction mode index(for example, 2) of a bottom-left diagonal direction to (theintra-prediction mode index of the lower-left diagonal direction+M). Inthis connection, M may be determined on the basis of a ratio of thecurrent block. When an intra-prediction mode for the current blockbelongs to a transform range, the intra-prediction mode may betransformed into a wide angle intra-prediction mode. The transform maybe adding a predefined value to the intra-prediction mode, and thepredefined value may be the total number (for example, 65) ofdirectional intra-prediction mode excluding a wide angleintra-prediction mode.

In the above example, intra-prediction mode from the number 2 to thenumber 15 may be respectively transformed into wide angleintra-prediction modes from the number 67 to the number 80

Hereinafter, intra-prediction modes belonging to a transform range arereferred to as wide angle intra prediction replacement modes.

A transform range may be determined on the basis of a ratio of thecurrent block. In an example, Tables 4 and 5 respectively show atransform range of a case where 35 intra-prediction modes excluding awide angle intra-prediction mode are defined, and a case where 67intra-prediction modes excluding a wide angle intra-prediction mode aredefined.

TABLE 4 Condition Replaced Intra Prediction Modes W/H = 2 Modes 2, 3, 4W/H > 2 Modes 2, 3, 4, 5, 6 W/H = 1 None H/W = 1/2 Modes 32, 33, 34 H/W< 1/2 Modes 30, 31, 32, 33, 34

TABLE 5 Condition Replaced Intra Prediction Modes W/H = 2 Modes 2, 3, 4,5, 6, 7 W/H > 2 Modes 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 W/H = 1 None H/W =1/2 Modes 61, 62, 63, 64, 65, 66 H/W < 1/2 Modes 57, 58, 59, 60, 61, 62,63, 64, 65, 66

As examples shown in Tables 4 and 5, the number of wide angle intraprediction replacement modes included in a transform range may varyaccording to a ratio of the current block.

The ratio of the current block may be further subdivided to set atransform range as shown in Table 6 below.

TABLE 6 Condition Replaced Intra Prediction Modes W/H = 16 Modes 12, 13,14, 15 W/H = 8 Modes 12, 13 W/H = 4 Modes 2, 3, 4, 5, 6, 7, 8, 9, 10, 11H/W = 2 Modes 2, 3, 4, 5, 6, 7 H/W = 1 None W/H = 1/2 Modes 61, 62, 63,64, 65, 66 W/H = 1/4 Modes 57, 58, 59, 60, 61, 62, 63, 64, 65, 66 W/H =1/8 Modes 55, 56 H/W = 1/16 Modes 53, 54, 55, 56

When the non-adjacent reference sample line is determined as thereference sample line for the current block or when the multi-line intraprediction encoding method for selecting one of the plurality ofreference sample lines is used, the prediction method may be configurednot to use the wide angle intra prediction mode. That is, although thecurrent block has a non-square shape, and the intra prediction mode forthe current block belongs to the transform range, the intra predictionmode for the current block may not be transformed into the wide angleintra prediction mode.

Alternatively, when the intra prediction mode for the current block isdetermined as the wide angle intra prediction mode, the predictionmethod may be configured such that the non-adjacent reference samplelines are unavailable as the reference sample line for the current blockor may be configured not to use the multi-line intra prediction encodingmethod for selecting one of the plurality of reference sample lines.When the multi-line intra prediction encoding method is not used, theadjacent reference sample line may be determined as the reference sampleline for the current block.

When the wide angle intra prediction mode is not used, each of refW andrefH may be set to a sum of nTbW and nTbH. Accordingly, the non-adjacentreference sample line spaced from the current block by i may include(nTbW+nTbH+offsetX[i]) top reference samples and (nTbW+nTbH+offsetY[i])left reference samples except for the left-top reference sample. Thatis, the non-adjacent reference sample line spaced from the current blockby i may include (2nTbW+2nTbH+offsetX[i]+offsetY[i]+1) referencesamples. For example, when a value of whRatio is greater than 1, a valueof offsetX may be set to be larger than a value of offsetY. In oneexample, when the value of offsetX may be set to 1, and the value ofoffsetY may be set to 0. To the contrary, when the value of whRatio issmaller than 1, the value of offsetY may be set to be larger than thevalue of offsetX. In one example, the value of offsetX may be set to 0,and the value of offsetY may be set to 1.

Since wide angle intra-prediction modes are used in addition to legacyintra-prediction modes, resource for encoding wide angleintra-prediction modes may be increased, and thus encoding efficiencymay be reduced. Accordingly, rather than encoding a wide angleintra-prediction mode as it is, a replaced intra-prediction mode for thewide angle intra-prediction modes are encoded so as to improve encodingefficiency.

In an example, when a current block is encoded by using a wide angleintra-prediction mode of the number 67, the number 2 that is a wideangle replacement intra-prediction mode of the number 67 may be encodedas an intra-prediction mode for the current block. In addition, when acurrent block is encoded by using a wide angle intra-prediction mode ofthe number −1, the number 66 that is a wide angle replacementintra-prediction mode of the number −1 may be encoded as anintra-prediction mode for the current block.

The decoder may decode an intra-prediction mode for the current block,and determine whether or not the decoded intra-prediction mode belongsto a transform range. When the decoded intra-prediction mode is a wideangle replacement intra-prediction mode, the intra-prediction mode maybe transformed into a wide angle intra-prediction mode.

Alternatively, when a current block is encoded through a wide angleintra-prediction mode, the wide angle intra-prediction mode may beencoded as it is.

Encoding of an intra prediction mode may be performed based on an MPMlist described above. Specifically, when a neighboring block is encodedin a wide angle intra prediction mode, an MPM may be set based on a wideangle replacement intra prediction mode corresponding to the wide angleintra prediction mode.

A residual image may be derived by subtracting a prediction image froman original image. In this connection, when the residual image isconverted into a frequency domain, even though high frequency componentsare removed from frequency components, subjective image quality of theimage does not drop significantly. Accordingly, when values of highfrequency components are transformed into small values, or when valuesof high frequency components are set to 0, compression efficiency may beincreased without causing large visual distortion. Reflecting the abovefeature, transform may be performed on a current block so as todecompose a residual image to two-dimensional frequency components. Thetransform may be performed by using transform methods such as DCT(discrete cosine transform), DST (discrete sine transform), etc.

DCT is to decompose (or transform) a residual image into atwo-dimensional frequency component by using cosine transform and DST isto compose (or transform) a residual image into a two-dimensionalfrequency component by using sine transform. As a result of transforminga residual image, frequency components may be represented as a baseimage. In an example, when DCT transform is performed for a N×N sizedblock, N2 basic pattern components may be obtained. A size of each ofbasic pattern components included in a N×N sized block may be obtainedthrough transform. According to a used transform method, a size of abasic pattern component may be referred to as a DCT coefficient or a DSTcoefficient.

A transform method DCT is mainly used to transform an image that a lotof non-zero low frequency components are distributed. A transform methodDST is mainly used for an image that a lot of high frequency componentsare distributed.

It is also possible to transform a residual image by using a transformmethod other than DCT or DST.

Hereinafter, transforming a residual image into two-dimensionalfrequency components is referred to as two-dimensional image transform.In addition, a size of basic pattern components obtained by transform isreferred to as a transform coefficient. In an example, a transformcoefficient may mean a DCT coefficient or a DST coefficient. When boththe after-described first transform and second transform are applied, atransform coefficient may mean a basic pattern component generated by aresult of the second transform. In addition, a residual sample to whichtransform skip is applied is also referred to as a transformcoefficient.

A transform method may be determined in a unit of a block. A transformmethod may be determined based on at least one of a prediction encodingmode of a current block, a size of a current block or a shape of acurrent block. In an example, when a current block is encoded by anintra-prediction mode and a size of a current block is smaller than N×N,transform may be performed by using a DST transform method. On the otherhand, when the condition is not satisfied, transform may be performed byusing a DCT transform method.

Two-dimensional image transform may not be performed for some blocks ofa residual image. Not performing two-dimensional image transform may bereferred to as transform skip. The transform skip represents that thefirst transform and the second transform are not applied to the currentblock. When transform skip is applied, quantization may be applied toresidual values for which transform is not performed.

Whether transform skip is allowed for a current block may be determinedbased on at least one of a size or a shape of a current block. In anexample, only when a size of a current block is smaller than a thresholdvalue, transform skip may be applied. The threshold value is related toat least one of a width, a height or the number of samples of a currentblock, and may be defined as 32×32, etc. Alternatively, transform skipmay be allowed only for a square block. In an example, transform skipmay be allowed for a 32×32, 16×16, 8×8 or 4×4 sized square block.Alternatively, only when a sub-partition intra encoding method is notused, transform skip may be allowed.

Alternatively, when a sub-partition intra encoding method is applied toa current block, it may be determined for each sub-block whether toapply transform skip.

FIG. 29 is a diagram showing an example in which whether transform skipis performed or not is determined per sub-block.

Transform skip may be applied only for part of a plurality ofsub-blocks. In an example, as in an example shown in FIG. 29, it may beset to apply transform skip to a sub-block at a top position of acurrent block and not to apply transform skip for a sub-block at abottom position.

A transform type of a sub-block that transform skip is not allowed maybe determined based on information signaled in a bitstream. In anexample, a transform type may be determined based on tu_mts_idx whichwill be described after.

Alternatively, a transform type of a sub-block may be determined basedon a size of a sub-block. In an example, a horizontal directionaltransform type may be determined based on whether a width of a sub-blockis equal to or greater than and/or equal to or less than a thresholdvalue, and a vertical directional transform type may be determined basedon whether a height of a sub-block is equal to or greater than and/orequal to or less than a threshold value.

After performing transform on a current block by using DCT or DST,transform may be performed again on the transformed current block. Inthis connection, transform based on DCT or DST may be defined as firsttransform, and performing transform again on a block to which firsttransform is applied may be defined as second transform.

First transform may be performed by using any one of a plurality oftransform core candidates. In an example, first transform may beperformed by using any one of DCT2, DCT8, or DST7.

Different transform cores may be used for a horizontal direction and avertical direction. Information representing a combination of atransform core of a horizontal direction and a transform core of avertical direction may be signaled in a bitstream.

A processing unit of first transform may differ with second transform.In an example, first transform may be performed on an 8×8 block, andsecond transform may be performed on a 4×4 sized sub-block within thetransformed 8×8 block. Alternatively, the second transform may beperformed for transform coefficients which belong to 3 4×4 sizedsub-blocks. The 3 sub-blocks may include a sub-block positioned at thetop-left of a current block, a sub-block neighboring the right of thesub-block and a sub-block neighboring the bottom of the sub-block.Alternatively, the second transform may be performed for a 8×8 sizedblock.

It is also possible that transform coefficients in a remaining region onwhich the second transform is not performed may be set to 0.

Alternatively, first transform may be performed on a 4×4 block, andsecond transform may be performed on a region having an 8×8 sizeincluding the transformed 4×4 block.

Information representing whether or not to perform second transform maybe signaled in a bitstream. In an example, a flag representing whetherthe second transform is performed or not, or index informationspecifying whether the second transform is performed or not and atransform kernel used for the second transform may be signaled. In anexample, when the index information is 0, it represents that the secondtransform is not performed for a current block. On the other hand, whenthe index information is greater than 0, a transform kernel for thesecond transform may be determined by the index information.

Alternatively, whether to perform the second transform may be determinedbased on whether a horizontal directional transform core and a verticaldirectional transform core are identical with each other. In oneexample, the second transform may be performed only when the horizontaldirectional transform core and the vertical directional transform coreare identical with each other. Alternatively, the second transform maybe performed only when the horizontal directional transform core and thevertical directional transform core are different from each other.

Alternatively, the second transform may be allowed only when apredefined transform core is used for the horizontal directionaltransform and the vertical directional transform. In one example, when aDCT2 transform core is used for transform in the horizontal directionand transform in the vertical direction, the second transform may beallowed. Alternatively, when a sub-partition intra encoding method isapplied to a current block, the second transform may be allowed onlywhen a DCT2 transform core is used for transform in a horizontaldirection and transform in a vertical direction.

Alternatively, it may be determined whether to perform the secondtransform based on the number of non-zero transform coefficients of thecurrent block. In one example, when the number of the non-zerotransforms coefficient of the current block is smaller than or equal toa threshold, the prediction method may be configured not to use thesecond transform. When the number of the non-zero transform coefficientsof the current block is greater than the threshold, the predictionmethod may be configured to use the second transform. As long as thecurrent block is encoded using intra prediction, the prediction methodmay be configured to use the second transform.

Alternatively, whether the second transform is performed or not may bedetermined based on a position of the last non-zero transformcoefficient of a current block. In an example, when at least one of anx-axis coordinate or a y-axis coordinate of the last non-zero transformcoefficient of a current block is greater than a threshold value, orwhen at least one of an x-axis coordinate or a y-axis coordinate of asub-block to which the last non-zero transform coefficient of a currentblock belongs is greater than a threshold value, the second transformmay not be performed. In this case, a threshold value may be predefinedin an encoding device and a decoding device. Alternatively, a thresholdvalue may be determined based on a size or a shape of a current block.

Alternatively, when only a transform coefficient of a DC componentexists in a current block, it may be set not to perform the secondtransform. In this case, a DC component represents a transformcoefficient at a top-left position in a current block.

Alternatively, when matrix-based intra-prediction is applied to acurrent block, it may be set not to perform the second transform.

Information representing a transform type of a current block may besignaled in a bitstream. The information may be index information,tu_mts_idx, representing one of combinations of a transform type for ahorizontal direction and a transform type for a vertical direction.

Based on transform type candidates specified by index information,tu_mts_idx, a transform core for a vertical direction and a transformcore for a horizontal direction may be determined. Table 9 representstransform type combinations according to tu_mts_idx.

TABLE 9 transform type tu_mts_idx horizontal vertical 0 DCT-II DCT-II 1DST-VII DST-VII 2 DCT-VIII DST-VII 3 DST-VII DCT-VIII 4 DCT-VIIIDCT-VIII

A transform type may be determined as one of DCT2, DST7 or DCT8.Alternatively, transform skip may be inserted in a transform typecandidate.

When Table 9 is used, DCT2 may be applied in a horizontal direction andin a vertical direction when tu_mts_idx is 0. When tu_mts_idx is 2, DCT8may be applied in a horizontal direction and DCT7 may be applied in avertical direction.

When a sub-partition intra encoding method is applied, a transform coreof a sub-block may be independently determined. In an example,information for specifying a transform type combination candidate may beencoded and signaled per sub-block. Accordingly, a transform corebetween sub-blocks may be different.

Alternatively, sub-blocks may use the same transform type. In this case,tu_mts_idx specifying a transform type combination candidate may besignaled only for the first sub-block. Alternatively, tu_mts_idx may besignaled in a coding block level and a transform type of sub-blocks maybe determined by referring to tu_mts_idx signaled in a coding blocklevel. Alternatively, a transform type may be determined based on atleast one of a size, a shape or an intra-prediction mode of one amongsub-blocks and a determined transform type may be set to be used for allsub-blocks.

FIG. 30 is a diagram showing an example in which sub-blocks use the sametransform type.

When a coding block is partitioned in a horizontal direction, atransform type of a sub-block at a top position of a coding block(Sub-CU0) may be set the same as that of a sub-block at a bottomposition (Sub-CU1). In an example, as in an example shown in FIG. 30(a), when a horizontal transform type and a vertical transform type aredetermined based on tu_mts_idx signaled for a top sub-block, adetermined transform type may be also applied to a bottom sub-block.

When a coding block is partitioned in a vertical direction, a transformtype of a sub-block at a left position of a coding block (Sub-CU0) maybe set the same as that of a sub-block at a right position (Sub-CU1). Inan example, as in an example shown in FIG. 30 (b), when a horizontaltransform type and a vertical transform type are determined based ontu_mts_idx signaled for a left sub-block, a determined transform typemay be also applied to a right sub-block.

Whether index information is encoded or not may be determined based onat least one of a size or a shape of a current block, the number ofnon-zero coefficients, whether the second transform is performed orwhether a sub-partition intra encoding method is applied. In an example,when a sub-partition intra encoding method is applied to a currentblock, or when the number of non-zero coefficients is equal to orsmaller than a threshold value, signaling of index information may beomitted. When signaling of index information is omitted, a defaulttransform type may be applied to a current block.

A default transform type may include at least one of DCT2 or DST7. Whenthere are a plurality of default transform types, one of a plurality ofdefault transform types may be selected by considering at least one of asize, a shape or an intra-prediction mode of a current block, whetherthe second transform is performed or whether a sub-partition intraencoding method is applied. In an example, one of a plurality oftransform types may be determined as a horizontal directional transformtype based on whether a width of a current block is in a preset range,and one of a plurality of transform types may be determined as avertical directional transform type based on whether a height of acurrent block is in a preset range. Alternatively, a default mode may bedetermined differently according to a size, a shape or anintra-prediction mode of a current block or whether the second transformis performed.

Alternatively, when only a transform coefficient of a DC componentexists in a current block, a horizontal directional transform type and avertical directional transform type may be set as a default transformtype. In an example, when only a transform coefficient of a DC componentexists in a current block, a horizontal directional transform type and avertical directional transform type may be set as DCT2.

A threshold value may be determined based on a size or a shape of acurrent block. In an example, when a size of a current block is equal toor smaller than 32×32, a threshold value may be set to be 2, and when acurrent block is greater than 32×32 (e.g., when a current block is a32×64 or 64×32 sized coding block), a threshold value may be set to be4.

A plurality of look-up tables may be prestored in an encoding device/adecoding device. At least one of an index value assigned to transformtype combination candidates, a type of transform type combinationcandidates or the number of transform type combination candidates may bedifferent for each of the plurality of look-up tables.

Based on at least one of a size, a shape or an intra-prediction mode ofa current block, whether the second transform is applied or not, orwhether transform skip is applied to a neighboring block, a look-uptable for a current block may be selected.

In an example, when a size of a current block is equal to or less than4×4, or when a current block is encoded by inter-prediction, a firstlook-up table may be used and when a size of a current block is greaterthan 4×4, or when a current block is encoded by intra-prediction, asecond look-up table may be used.

Alternatively, information indicating one of a plurality of look-uptables may be signaled in a bitstream. A decoding device may select alook-up table for a current block based on the information.

In another example, an index assigned to a transform type combinationcandidate may be adaptively determined based on at least one of a size,a shape, a prediction encoding mode or an intra-prediction mode of acurrent block, whether the second transform is applied or not, orwhether transform skip is applied to a neighboring block. In an example,an index assigned to transform skip when a size of a current block is4×4 may be smaller than an index assigned to transform skip when a sizeof a current block is greater than 4×4. Concretely, when a size of acurrent block is 4×4, an index 0 may be assigned to transform skip andwhen a current block is greater than 4×4 and equal to or less than16×16, an index greater than 0 (e.g., an index 1) may be assigned totransform skip. When a current block is greater than 16×16, the maximumvalue (e.g., 5) may be assigned to an index of transform skip.

Alternatively, when a current block is encoded by inter-prediction, anindex 0 may be assigned to transform skip. When a current block isencoded by intra-prediction, an index greater than 0 (e.g., an index 1)may be assigned to transform skip.

Alternatively, when a current block is a 4×4 sized block encoded byinter-prediction, an index 0 may be assigned to transform skip. On theother hand, when a current block is not encoded by inter-prediction, orwhen a current block is greater than 4×4, an index greater than 0 (e.g.,an index 1) may be assigned to transform skip.

It is also possible to use transform type combination candidatesdifferent from transform type combination candidates enumerated in Table9. In an example, a transform type combination candidate which isconsisted of transform skip applied to one of a horizontal directionaltransform or a vertical directional transform and a transform core suchas DCT2, DCT8 or DST7, etc. applied to the other can be used. In thiscase, whether transform skip will be used as a transform type candidatefor a horizontal direction or a vertical direction may be determinedbased on at least one of a size (e.g., a width and/or a height), ashape, a prediction encoding mode or an intra-prediction mode of acurrent block.

Information representing whether index information for determining atransform type of a current block is explicitly signaled may be signaledin a bitstream. In an example, sps_explicit_intra_mts_flag, informationrepresenting whether an explicit transform type determination is allowedfor a block encoded by intra-prediction, and/orsps_explicit_inter_mts_flag, information representing whether anexplicit transform type determination is allowed for a block encoded byinter-prediction, may be signaled at a sequence level.

When an explicit transform type determination is allowed, a transformtype of a current block may be determined based on index information,tu_mts_idx, signaled in a bitstream. On the other hand, when an explicittransform type determination is not allowed, a transform type may bedetermined based on at least one of a size or a shape of a currentblock, whether it is allowed to perform transform in a unit of asub-block, a position of a sub-block including a non-zero transformcoefficient, whether the second transform is performed or not, orwhether a sub-partition intra encoding method is applied or not. In anexample, a horizontal directional transform type of a current block maybe determined based on a width of a current block and a verticaldirectional transform type of a current block may be determined based ona height of a current block. For example, when a width of a currentblock is smaller than 4 or greater than 16, a horizontal directionaltransform type may be determined as DCT2. Otherwise, a horizontaldirectional transform type may be determined as DST7. When a height of acurrent block is smaller than 4 or greater than 16, a verticaldirectional transform type may be determined as DCT2. Otherwise, avertical directional transform type may be determined as DST7. In thiscase, a threshold value which is to be compared with a width and aheight may be determined based on at least one of a size, a shape or anintra-prediction mode of a current block to determine a horizontaldirectional transform type and a vertical directional transform type.

Alternatively, when a current block has a square shape whose height andwidth are the same, a horizontal directional transform type and avertical directional transform type may be set the same, but when acurrent block has a non-square shape whose height and width aredifferent from each other, a horizontal directional transform type and avertical directional transform type may be set differently. In anexample, when a width of a current block is greater than a height, ahorizontal directional transform type may be determined as DST7 and avertical directional transform type may be determined as DCT2. When aheight of a current block is greater than a width, a verticaldirectional transform type may be determined as DST7 and a horizontaldirectional transform type may be determined as DCT2.

The number and/or type of transform type candidates or the number and/ortype of transform type combination candidates may be different accordingto whether an explicit transform type determination is allowed or not.In an example, when an explicit transform type determination is allowed,DCT2, DST7 and DCT8 may be used as transform type candidates.Accordingly, each of a horizontal directional transform type and avertical directional transform type may be set as DCT2, DST8 or DCT8.When an explicit transform type determination is not allowed, only DCT2and DST7 may be used as a transform type candidate. Accordingly, each ofa horizontal directional transform type and a vertical directionaltransform type may be determined as DCT2 or DST7.

The decoder may perform inverse-transform (second inverse-transform) tothe second transform and may perform inverse-transform (firstinverse-transform) to the first transform resultant from the secondinverse-transform. As a result of performing the secondinverse-transform and the first inverse-transform, residual signals forthe current block may be obtained.

When transform and quantization are performed by the encoder, thedecoder may obtain the residual block via inverse-quantization andinverse-transform. The decoder may add the prediction block and theresidual block to each other to obtain the reconstructed block for thecurrent block.

When the reconstructed block of the current block is obtained, loss ofinformation as occurring in the process of the quantization and encodingmay be reduced via the in-loop filtering. The in-loop filter may includeat least one of a deblocking filter, a sample adaptive offset filter(SAO), or an adaptive loop filter (ALF). Hereinafter, a reconstructedblock before an in-loop filter is applied is referred to as a firstreconstructed block and a reconstructed block after an in-loop filter isapplied is referred to as a second reconstructed block.

The second reconstructed block may be obtained by applying at least oneof a deblocking filter, SAO or ALF to the first reconstructed block. Inthis connection, SAO or ALF may be applied after the deblocking filteris applied.

A deblocking filter is to alleviate quality degradation (e.g. BlockingArtifact) on a boundary of a block which occurs as quantization isperformed per block. To apply the deblocking filter, a blocking strength(BS) between the first reconstructed block and a neighboringreconstructed block may be determined.

FIG. 31 is a flow diagram showing a process of determining a blockingstrength.

In an example shown in FIG. 31, P represents a first reconstructed blockand Q represents a neighboring reconstructed block. In this connection,the neighboring reconstructed block may neighbor a left or top of thecurrent block.

An example shown in FIG. 31 showed that a blocking strength isdetermined considering a prediction encoding mode of P and Q, whether atransform coefficient which is not 0 is included, whetherinter-prediction is performed by using the same reference picture orwhether the difference value of motion vectors is equal to or greaterthan a threshold value.

Based on a blocking strength, whether a deblocking filter is applied maybe determined. In an example, when the blocking strength is 0, filteringmay not be performed.

SAO is to alleviate ringing artifact which occurs as quantization isperformed in a frequency region. SAO may be performed by adding orsubtracting an offset determined by considering a pattern of a firstreconstructed image. The determination method of the offset includesEdge Offset (EO) or Band Offset (BO). EO represents a method determiningthe offset of a current sample according to a pattern of neighboringpixels. BO represents a method applying a common offset to a group ofpixels with a similar brightness value in a region. Concretely, pixelbrightness may be partitioned into 32 uniform sections and pixels with asimilar brightness value may be set as one group. In an example, 4adjacent bands among 32 bands may be set as one group and the sameoffset value may be applied to samples belonging to 4 bands.

ALF is a method of generating a second reconstructed image by applying afilter with a predefined size/shape to a first reconstructed image or areconstructed image that a deblocking filter is applied. The followingEquation 8 represents an example in which ALF is applied.

$\begin{matrix}{{R^{\prime}\left( {i,j} \right)} = {\sum\limits_{k = {- \frac{N}{2}}}^{N_{2}}{\sum\limits_{l = {- \frac{N}{2}}}^{N_{2}}{{f\left( {k,l} \right)} \cdot {R\left( {{i + k},{j + 1}} \right)}}}}} & \left\lbrack {{Equation}\mspace{14mu} 8} \right\rbrack\end{matrix}$

Any one of predefined filter candidates may be selected in a basis of apicture, a coding tree unit, a coding block, a prediction block or atransform block. At least one of a size or shape of each filtercandidate may be different.

FIG. 32 represents predefined filter candidates.

As in an example shown in FIG. 32, at least any one of a 5×5, 7×7 or 9×9sized diamond shape may be selected.

Only a 5×5 sized diamond shape may be used for a chroma component.

A method of partitioning a picture into a plurality of regions andencoding/decoding the plurality of regions in parallel may be consideredfor the real-time or low delay encoding of a high resolution image suchas a panoramic video, a 360-degree video or 4K/8K UHD (Ultra HighDefinition). Concretely, according to a purpose of processing, a picturemay be partitioned into tiles or slices (or tile groups).

A tile represents a base unit for parallel encoding/decoding. Each tilemay be processed in parallel. A tile may have a rectangular shape.Alternatively, a non-rectangular tile may be allowed.

Information representing whether a non-rectangular tile is allowed orwhether there is a non-rectangular tile may be signaled in a bitstream.

In encoding/decoding a tile, it may be set not to use data of othertile. A parallel processing of tiles may be supported by removingencoding/decoding dependency between tiles. Concretely, a probabilitytable of CABAC (Context Adaptive Binary Arithmetic Coding) context maybe initialized per tile and an in-loop filter may be set not to beapplied on a boundary of tiles. In addition, data in other tile may notbe used as a candidate for deriving a motion vector. For example, datain other tile may be set not to be used as a merge candidate, a motionvector prediction candidate (AMVP candidate) or a motion informationcandidate. In addition, data in another tile may be set not to be usedfor context computation of a symbol.

Information on video encoding/decoding may be signaled by a sliceheader. Information signaled by the slice header may be commonly appliedto coding tree units or tiles included in the slice. The slice also canbe referred to as a tile group.

FIG. 33 is a diagram showing a picture partitioning method according toan embodiment of the present disclosure.

First, whether a current picture is partitioned into a plurality ofprocessing units may be determined 53310. In this connection, aprocessing unit may include at least one of a tile or a slice. In anexample, a syntax, no pic partition flag, indicating whether a currentpicture is partitioned into a plurality of tiles or slices, may besignaled in a bitstream. If a value of the syntax, no pic partitionflag, is 0, it represents that a current picture is partitioned into atleast one tile or at least one slice. On the other hand, if a value of asyntax, no pic partition flag, is 1, it represents that a currentpicture is not partitioned into a plurality of tiles or slices.

When it is determined that a current picture is not to be partitionedinto a plurality of processing units, a partitioning process of thecurrent picture may be ended. In this connection, it may be understoodthat the current picture is composed of a single tile and a single slice(or a single tile group).

Alternatively, information representing whether a plurality of tilesexist in a picture may be signaled in a bitstream. The information mayinclude at least one of a 1-bit flag representing whether a plurality oftiles exist in a picture or information specifying the number of tilesin a picture.

When it is determined that a current picture is to be partitioned into aplurality of processing units, tile partitioning information may besignaled in a bitstream. A picture may be partitioned into at least onetile based on the signaled tile partitioning information S3320.

When a current picture is partitioned into a plurality of tiles, a slicemay be determined by combining a plurality of tiles or partitioning atile S3330.

Hereinafter, according to the present disclosure, a tile partitioningmethod and a slice determination method will be described in detail.

FIG. 34 represents an example in which a picture is partitioned into aplurality of tiles.

A tile may include at least one coding tree unit. A boundary of the tilemay be set to match a boundary of a coding tree unit. In other words, apartitioning type that one coding tree unit is partitioned into pluralmay not be allowed.

When a picture is partitioned into a plurality of tiles, a height ofadjacent tiles or a width of adjacent tiles may be set to have the samevalue.

In an example, as in an example shown in FIG. 34, a height of tilesbelonging to the same tile row and/or a width of tiles belonging to thesame tile column may be set the same. Tiles belonging to the same tilerow may be referred to as a horizontal directional tile set and tilesbelonging to the same tile column may be referred to as a verticaldirectional tile set.

Alternatively, information representing whether a width and/or a heightof a tile to be encoded/decoded is set the same as a width and/or aheight of a previous tile may be signaled.

Information representing a partitioning shape of a picture may besignaled in a bitstream. The information may be encoded and signaled bya picture parameter set, a sequence parameter set or a slice header.

Information representing a partitioning shape of a picture may includeat least one of information indicating whether tiles are partitioned ina uniform size, information representing the number of tile columns orinformation representing the number of tile rows. In this case, thenumber of tile columns represents the number of vertical directionaltile sets and the number of tile rows represents the number ofhorizontal directional tile sets.

Information indicating whether tiles are partitioned in a uniform sizemay be a 1-bit flag, uniform spacing flag. When it is determined that apicture is partitioned in a uniform size, remaining tiles except fortiles adjacent to a right and/or bottom boundary of the picture may havethe same size.

As a picture is partitioned by using at least one of a vertical line ora horizontal line across a picture, each tile belongs to a differentcolumn and/or row. To determine a partitioning shape of the picture,information representing the number of tile columns and/or tile rows maybe signaled. In an example, information, num_tile_row_minus1,representing the number of tile rows, and information,num_tile_column_minus1, representing the number of tile columnsgenerated by partitioning the picture may be signaled in a bitstream. Asyntax, num_tile_row_minus1, represents a value subtracting 1 from thenumber of tile rows and a syntax, num_tile_column_minus1, represents avalue subtracting 1 from the number of tile columns.

In an example shown in FIG. 34, the number of tile columns is 4 and thenumber of tile rows is 3. Accordingly, num_tile_columns_minus1 mayrepresent 3 and num_tile_rows_minus1 may represent 2.

A syntax, num_tile_column_minus1, representing the number of tilecolumns, and/or a syntax, num_tile_rows_minus1, representing the numberof tile rows may be signaled when a value of a syntax,uniform_tile_spacing_flag, is 0. In other words, when a current pictureis determined not to be partitioned into tiles whose height and widthare uniform, a syntax, num_tile_column_minus1, representing the numberof tile columns, and/or a syntax, num_tile_rows_minus1, representing thenumber of tile rows may be signaled.

A syntax representing a width of each tile column and a syntaxrepresenting a height of each tile row may be signaled in a bitstream.In an example, tile_cols_width_minus1[i] may represent a width of thei-th tile column and tile_rows_height_minus1[j] may represent a heightof the j-th tile row.

A width of the last tile column may be derived by subtracting a width ofprevious tile columns from a width of a current picture.

A syntax, tile rows height minus1[j], represents a value subtracting 1from the number of coding tree unit rows constituting the j-th tile row.Signaling of a syntax, tile_rows_height_minus1[j], may be omitted forthe last tile row. A height of the last tile row may be derived bysubtracting a height of previous tile rows from a height of a currentpicture.

The last tile row may have a height equal to or smaller than a valuespecified by a syntax, tile_cols_width_minus1. In an example, when anindex of the last tile row is n, a value subtracting a height of the0-th to (n−1)-th tile rows from a height of a current block may be setas a height of the last tile row. In other words, a height of a tilepositioned on a bottom boundary of a current picture may be smaller thanor the same as that of another tile.

Meanwhile, information representing a size of a coding tree unit may besignaled through a sequence parameter set or through a picture parameterset.

One tile may be configured with at least one coding tree unit. Remainingtiles excluding a tile adjacent to the right or the lower boundary of apicture may be set not to be configured by including a region smallerthan a coding tree unit. In other words, the boundary of a tile matchesthat of a coding tree unit.

According to a partitioning shape of a picture, tiles may have the samesize in all regions excluding a picture boundary. Alternatively, aheight of tiles which are adjacent horizontally may be set to be thesame or a width of tiles which are adjacent vertically may be set to bethe same.

Information representing whether a current picture is partitioned into aplurality of tiles may be signaled in a bitstream. In an example, asyntax, single_tile_in_pic_flag, may be signaled in a bitstream. When asyntax, single_tile_in_pic_flag, is 1, it represents that a currentpicture is not partitioned into a plurality of tiles. On the other hand,when single_tile_in_pic_flag is 0, it represents that a current pictureis partitioned into a plurality of tiles.

When a current picture is determined to be partitioned into a pluralityof tiles, at least one of information for determining the number of tilecolumns and tile rows, information representing whether tiles areuniformly partitioned or information for determining a size of a tilecolumn and a tile row may be encoded.

TABLE 8 pic_parameter_set_rbsp( ) { Descriptor  pps_pic_parameter_set_idue(v)  pps_seq_parameter_set_id ue(v)  transform_skip_enabled_flag u(1) single_tile_in_pic_flag u(1)  if( !single_tile_in_pic_flag ) {  num_tile_columns_minus1 ue(v)   num_tile_rows_minus1 ue(v)  uniform_tile_spacing_flag u(1)   if( !uniform_tile_spacing_flag ) {   for( i = 0; i < num_tile_columns_minus1; i++ )    tile_column_width_minus1[ i ] ue(v)    for( i = 0; i <num_tile_rows_minus1; i++ )     tile_row_height_minus1[ i ] ue(v)   }

Information for determining a tile size may be encoded and signaled. Inan example, a syntax element, tile_width_minus1[i], representing a widthof the i-th tile column, and a syntax element, tile_height_minus1[i],representing a height of the i-th tile row may be encoded in abitstream.

Information for specifying the number of tile columns whose width isexplicitly signaled in a current picture may be signaled in a bitstream.In an example, a syntax, num_exp_tile_columns_minus1, for determiningthe number of tile columns whose width is signaled, may be signaled in abitstream. A syntax, num_exp_tile_columns_minus1, may be a valuesubtracting 1 from the number of tile columns whose width is signaled.

As many as the number determined based on a syntax,num_exp_tile_columns_minus1, a syntax for specifying a width of a tilecolumn may be encoded and signaled. In an example, a syntax,tile_width_minus1[i], representing a width of the i-th tile column, maybe signaled in a bitstream.

When an index i of a tile column is smaller than the number of tilecolumns whose width is explicitly signaled, a width of the correspondingtile column may be determined based on a syntax, tile_width_minus1[i],signaled in a bitstream.

On the other hand, When an index j of a tile column is equal to orgreater than the number of tile columns whose width is explicitlysignaled, a width of the corresponding tile column may be determinedbased on a syntax, tile_width_minus1[l], which is signaled last. In thiscase, l may represent an index of a tile column whose width is signaledlast and may be an integer smaller than j. In an example, when a valuesubtracting a width of previous tile columns from a width of a currentpicture is equal to or greater than a value adding 1 to a syntax,tile_width_minus1[l], a width of a tile_column j may be set as a valueadding 1 to a syntax, tile width minus1[1]. On the other hand, when avalue subtracting widths of previous tile columns from a width of acurrent picture is smaller than a value adding to a syntax, tile widthminus1[l], a difference value subtracting widths of previous tilecolumns from a width of a current picture may be set as a width of atile column j.

In other words, a width of remaining tile columns excluding tile columnswhose width is explicitly signaled may have a value smaller than orequal to a width of the last tile column among tile columns whose widthis explicitly signaled.

Information for specifying the number of tile columns whose width isexplicitly signaled in a current picture may be signaled in a bitstream.In an example, a syntax, num_exp_tile_columns_minus1, for determiningthe number of tile columns whose width is signaled, may be signaled in abitstream. A syntax, num_exp_tile_columns_minus1, may be a valuesubtracting 1 from the number of tile columns whose width is signaled.

As many as the number determined based on a syntax,num_exp_tile_rows_minus1, a syntax for specifying a height of a tile rowmay be encoded and signaled. In an example, a syntax,tile_height_minus1[i], representing a height of the i-th tile row may besignaled in a bitstream.

When an index i of a tile row is smaller than the number of tile rowswhose height is explicitly signaled, a height of the corresponding tilerow may be determined based on a syntax, tile_height_minus1[i], signaledin a bitstream.

On the other hand, When an index j of a tile row is equal to or greaterthan the number of tile rows whose height is explicitly signaled, aheight of the corresponding tile row may be determined based on asyntax, tile_height_minus1[l], which is signaled last. In this case, lmay represent an index of a tile row whose height is signaled last andmay be an integer smaller than j.

In an example, when a value subtracting heights of previous tile rowsfrom a height of a current picture is equal to or greater than a valueadding 1 to a syntax, tile_height_minus1[l], a height of a tile row jmay be set as a value adding 1 to a syntax, tile_height_minus1[l]. Onthe other hand, when a value subtracting heights of previous tile rowsfrom a height of a current picture is smaller than a value adding to asyntax, tile_height_minus1[l], a difference value subtracting heights ofprevious tile rows from a height of a current picture may be set as aheight of a tile row j.

In other words, a height of remaining tile rows excluding tile rowswhose height is explicitly signaled may have a value smaller than orequal to a width of the last tile row among tile rows whose height isexplicitly signaled.

A tile may be recursively partitioned. In an example, one tile may bepartitioned into a plurality of tiles.

Each of a plurality of tiles generated by partitioning a tile may bereferred to as a sub-tile or a brick. A brick may be a unit of parallelprocessing. In an example, a brick may be independently encoded/decodedeach other. In encoding/decoding a block included in a brick, it may beset not to use data of another block. In an example, a sample includedin another brick may be set to be unavailable as a reference sample forintra prediction. Alternatively, data in another brick may be set not tobe used as a merge candidate, a motion vector prediction candidate (AMVPcandidate) or a motion information candidate. Alternatively, data inother brick may not be used for context calculation of a symbol.

FIG. 35 is a diagram for explaining a generation aspect of a brick.

A brick may be generated by partitioning a tile in a horizontaldirection. In an example, an example shown in FIG. 35 showed that tilesbelonging to the last tile column in a current picture are partitionedinto 2 bricks.

When it is assumed that a raster scan is applied to tiles, a raster scanmay be applied between bricks. In an example, after scanning all bricksincluded in a specific tile, a subsequent tile may be scanned. In otherwords, a brick may have the same status as a tile.

The boundary of a brick may match that of a coding tree unit. In otherwords, at least one coding tree unit row in a tile may be defined as abrick.

Information representing whether a tile is partitioned into a pluralityof bricks may be signaled in a bitstream. Table 9 represents a syntaxtable including information for determining whether a tile ispartitioned.

TABLE 9 pic_parameter_set_rbsp( ) { Descriptor  pps_pic_parameter_set_idue(v)  pps_seq_parameter_set_id ue(v)  single_tile_in_pic_flag u(1)  if(!single_tile_in_pic_flag ) {   uniform_tile_spacing_flag u(1)   if(uniform_tile_spacing_flag ) {    tile_cols_width_minus1 ue(v)   tile_rows_height_minus1 ue(v)   } else {    num_tile_columns_minus1ue(v)    num_tile_rows_minus1 ue(v)    for( i = 0; i <num_tile_columns_minus1; i++ )     tile_column_width_minus1[ i ] ue(v)   for( i = 0; i < num_tile_rows_minus1; i++ )    tile_row_height_minus1[ i ] ue(v)   }   brick_splitting_present_flagu(1)   for( i = 0; brick_splitting_present_flag && i < NumTilesInPic;i++) }    brick_split_flag[ i ] u(1)    if( brick_split_flag[ i ]) }    uniform _brick_spacing_flag[ i ] u(1)     if(uniform_brick_spacing_flag[ i ] )      brick_height_minus1[ i ] ue(v)    else }      num_brick_rows_minus1[ i ] ue(v)      for( j = 0; j <num_brick_rows_minus1[ i ]; j++ )       brick_row_height_minus1[ i ][ j] ue(v)     }    }   }   single_brick_per_slice_flag u(1)   if(!single_brick_per_slice_flag )    rect_slice_flag u(1)   if(rect_slice_flag && !single_brick_per_slice_flag ) }   num_slices_in_pic_minus1 ue(v)    for( i = 0; i +21=num_slices_in_pic_minus1; i++ ) }     if( i > 0 )     top_left_brick_idx[ i ] u(v)     bottom_right_brick_idx_delta[ i ]u(v)    }   }   loop_filter_across_bricks_enabled_flag u(1)   if(loop_filter_across_bricks_enabled_flag )   loop_filter_across_slices_enabled_flag u(1)  }

Information related to brick partitioning may include at least one ofinformation representing whether there is at least one tile partitionedinto bricks, information representing whether a tile is partitioned intobricks, information representing the number of bricks in a tile orinformation representing a size of a brick.

In an example, a syntax, brick_splitting_present_flag, representingwhether there is at least one tile partitioned into bricks may besignaled in a bitstream.

When a syntax, brick_splitting_present_flag, is 1, at least one or moretiles may be partitioned into a plurality of bricks. When a syntax,brick_splitting_present_flag, is 1, brick_split_flag representingwhether a tile is partitioned into a plurality of bricks may beadditionally signaled.

When a syntax, brick_splitting_present_flag, is 0, it represents thatthere is no tile partitioned into a plurality of bricks in a currentpicture or pictures referring to PPS. When a syntax,brick_splitting_present_flag, is 0, encoding of brick_split_flagrepresenting whether a tile is partitioned into a plurality of bricksmay be omitted.

When it is determined that a tile partitioned into a plurality of bricksis present in a current picture, a syntax, brick_split_flag[i],representing whether the i-th tile is partitioned into a plurality ofbricks, may be signaled. In an example, when a value of a syntax,brick_split_flag[i], is 1, it represents that a tile whose tile index isi is partitioned into two or more bricks. When a value of a syntax,brick_split_flag[i], is 0, it represents that a tile whose tile index isi is not partitioned.

When a tile is partitioned into a plurality of bricks, information fordetermining a partition aspect of a tile may be signaled in a bitstream.In an example, a syntax, uniform_brick_spacing_flag, may be signaled ina bitstream. When a syntax, uniform_brick_spacing_flag, is 1, itrepresents that a height of bricks in a tile is uniform. When a value ofuniform_brick_spacing_flag is 1, a syntax_brick_height_minus1,representing a base height of a brick may be signaled. A syntax,brick_height_minus1, represents a value obtained by subtracting 1 fromthe number of coding tree units which constitutes a brick.

Remaining bricks excluding the last brick in a tile may have a baseheight determined by a syntax, brick_height_minus1. The last brick in atile may be set as a remaining region excluding the other bricks.

When a value of a syntax, uniform_brick_spacing_flag, is 0, a syntax,num_brick_rows_minus1[i], representing the number of bricks in the i-thtile and a syntax, brick_row_height_minus1[i][j], representing a heightof the j-th brick in the i-th tile may be signaled. A sytax,num_brick_rows_minus1[i], represents a value obtained by subtracting 1from the number of bricks included in i-th tile.

The signaling of a syntax, brick_row_height_minus1[i], may be omittedfor the last brick in a tile. A height of the last brick in a tile maybe derived by subtracting a sum of heights of previous bricks from aheight of a tile.

A syntax, brick_height_minus1[i], representing a height of a brick mayhave a value smaller than a value subtracting 1 from a height of a tileincluding a brick. In an example, when a height of a tile is rowHeight,a syntax, brick_height_minus1[i], may have a value between 0 androwHeight−2. In this case, rowHeight represents the number of codingtree unit rows included by a tile.

Alternatively, a partitioning aspect of a tile may be determined byomitting encoding of a flag representing whether a tile is uniformlypartitioned and using at least one of information representing thenumber of bricks and information representing a height of a brick.

Alternatively, a partitioning aspect of a tile may be determined byusing information specifying the number of bricks whose height isexplicitly signaled. In an example, a syntax, num_exp_brick_minus1, fordetermining the number of bricks whose height is signaled may besignaled in a bitstream. A syntax, num_exp_brick_minus1, may have avalue subtracting 1 from the number of bricks whose height is explicitlysignaled.

As many as the number determined based on a syntax,num_exp_brick_minus1, a syntax for specifying a height of bricks may beencoded and signaled. In an example, brick_height_minus1[i] represents aheight of the i-th brick.

When an index i of a brick is smaller than the number of bricks whoseheight is signaled, a height of the corresponding brick may bedetermined based on brick_height_minus1[i] signaled in a bitstream. Onthe other hand, When an index j of a brick is equal to or greater thanthe number of bricks whose height is signaled, a height of thecorresponding brick may be set the same as brick_height_minus1[l], asyntax which is signaled last. In this case, l may represent an index ofa brick whose height is signaled last and may be an integer smaller thanj.

A tile and a brick may be identified by a tile index. A tile index maybe assigned to each tile and brick in the raster scanning order. Whenone tile is partitioned into a plurality of bricks, a tile index may beassigned to each of a plurality of bricks.

In the after-mentioned embodiment, a term, ‘a tile’, may include tilesgenerated by partitioning a tile (i.e., a sub-tile or a brick) as wellas a tile.

At least one or more tiles may be defined as one processing unit. In anexample, a plurality of tiles may be defined as one slice. A slice maybe referred to as a tile group.

Alternatively, one tile may be partitioned into a plurality ofprocessing units. In an example, a tile may be partitioned into aplurality of slices. In this connection, one slice may include at leastone coding tree unit column. When a tile is partitioned into a pluralityof slices, information representing a height of each slice may besignaled in a bitstream.

Image encoding/decoding information may be signaled through a sliceheader. Information signaled through a slice header may be commonlyapplied to tiles and/or blocks belong to a slice.

Information representing a slice type represents a definition method ofa slice in a current picture. In an example, a syntax, rect_slice_flag,representing a slice type may be signaled in a bitstream.

A syntax, rect_slice_flag, represents whether a slice is defined basedon a raster scanning order of tiles or whether a slice is defined in arectangular shape. In an example, when rect_slice_flag is 0, itrepresents that a slice is defined based on a raster scanning order oftiles. On the other hand, when rect_slice_flag is 1, it represents thata slice is defined in a rectangular shape.

Hereinafter, the two methods for determining a slice will be describedin detail.

A definition method based on raster scanning is to define a slice basedon a raster scanning order of tiles. Under a definition method based onraster scanning, one or more consecutive tile(s) may be defined as aslice. In this case, an order between consecutive tiles may bedetermined based on a raster scanning order. When a raster scanningslice is applied, a slice in a non-rectangular shape may be generated.

FIGS. 36 and 37 are diagrams showing an example in which a slice isdefined based on a raster order.

In an example, in an example shown in FIG. 36, when it is assumed thatthe first slice, slice0, includes 3 tiles, the first slice, slice0, maybe defined as including Tile0 to Tile2 according to a raster scanningorder. When it is assumed that the second slice, slice1, includes 6tiles, the second slice, slice1, may be defined as including Tile3 toTile8 according to a raster scanning order. The last slice, slice2, mayinclude residual tiles, Tile9 to Tile11, according to a raster scanningorder.

When a slice is defined based on a raster scanning order, informationrepresenting the number of tiles included by each slice may be signaled.Signaling of information representing the number of tiles included by aslice may be omitted for the last slice.

When a slice includes a plurality of tiles, a width or a height of tilesincluded in a slice may be different. In an example, it was shown that aheight of Tile3 among tiles included by the second slice, slice1, isdifferent from other tiles.

A definition method of a slice in a rectangular shape is a partitioningmethod which allows only a slice in a rectangular shape. When adefinition method of a slice in a rectangular shape is applied, tilespositioned at four corners of a slice belong to the same row or the samecolumn.

FIG. 38 is a diagram showing an example in which only a slice in arectangular shape is allowed.

As in an example shown in FIG. 38, the fourth slice, slice3, includesTile5, Tile6, Tile9 and Tile10. As in a shown example, when a sliceincludes a plurality of tiles, a rectangle which has a top-left tile anda bottom-right tile as two vertices thereof may be defined as one slice.

A boundary of a slice may match that of a picture and/or that of a tile.In an example, a left boundary or a top boundary of a slice may be setas a boundary of a picture, or a left boundary or a top boundary of aslice may be set as a boundary of a tile.

When a definition method of a slice in a rectangular shape is applied,information for identifying tiles included by each slice may be signaledto determine tiles included by each slice. The information may be usedto specify at least one of the first tile or the last tile of a slice.An order between tiles may be determined according a predeterminedscanning order. In an example, when a raster scanning order is applied,the first tile indicates a tile at a top-left position of a slice andthe last tile indicates a tile at a bottom-right position of a slice.

Information for identifying at least one of an index of a tile at atop-left position of a slice or an index of a tile at a bottom-rightposition of the slice may be signaled in a bitstream. In an example, atleast one of a syntax, top left tile idx, for identifying an index of atile at a top-left position of a slice, or a syntax, bottom right tileidx, for identifying an index of a tile at a bottom-right position of aslice may be signaled in a bitstream. Encoding of at least one of asyntax for identifying an index of a tile at a top-left position of aslice or a syntax for identifying an index of a tile at a bottom-rightposition of a slice may be omitted for the last slice. A remainingregion excluding a region occupied by previous slices in a currentpicture may be set as the last slice.

In an example, in an example shown in FIG. 38, top_left_tile_idxrepresenting an index of a tile at a top-left position of a slice, andbottom_right_tile_idx representing an index of a tile at a bottom-rightposition of a slice may be signaled for each of slice0, slice1 andslice2. On the other hand, encoding of top_left_tile_idx andbottom_right_tile_idx may be omitted for the last slice, slice3, in apicture. An index of a top-left tile of the last slice, slice3, in apicture, may be set as an index of a tile at a top-left position in aremaining region excluding slice0, slice1 and slice2 in a picture and anindex of a bottom-right tile of slice3 may be set as an index of a tileat a bottom-right position in the remaining region (or, a tile at abottom-right position of a picture).

Alternatively, difference information for specifying an index of a tileincluded in a slice may be encoded and signaled. In an example,information representing a difference value of an index of a tile at atop-left position of a slice and an index of a tile at a bottom-rightposition of the slice may be signaled in a bitstream. In an example, asyntax, top_left_tile_idx[i], for identifying an index of a tile at atop-left position of a slice, and a syntax,bottom_right_tile_idx_delta[i], representing a difference between anindex of a tile at a top-left position of a slice and an index of a tileat a bottom-right position of a slice, may be signaled for the i-thslice. An index of a bottom-right tile of the i-th slice may be derivedby summing top_left_tile_idx[i] and bottom_right_tile_idx_delta[i].Encoding of at least one of a syntax representing an index of a tile ata top-left position of a slice or a syntax representing a difference ofan index of a tile at a top-left position of a slice and an index of atile at a bottom-right position of a slice may be omitted for the lastslice. A remaining region excluding a region occupied by previous slicesin a current picture may be set as the last slice.

Alternatively, at least one of horizontal directional tile indexdifference information or vertical directional tile index differenceinformation may be encoded and signaled. Horizontal directional tileindex difference information may represent a difference between an indexof the first tile and an index of the rightmost tile included in thesame tile row as the first tile. Vertical directional tile indexdifference information may represent a difference between an index ofthe first tile and an index of the lowest tile included in the same tilecolumn as the first tile.

According to a position of a slice, a difference information type to beencoded may be determined. In an example, for a slice adjacent to aright boundary or a bottom boundary of a picture, horizontal directionaltile index difference information or vertical directional tile indexdifference information may be encoded and signaled. The amount of bitsmay be reduced by encoding horizontal directional tile index differenceinformation or vertical directional tile index difference informationinstead of information representing an index difference between atop-left tile and a top-right tile.

Alternatively, when a picture is partitioned into at least one or moreslice rows, information representing an index difference between atop-left tile and a bottom-right tile may be encoded for a sliceadjacent to a left boundary of a picture. Slices belonging to the samerow may be set to have the same height.

Difference information between an index of a tile included in the firstslice and an index of a tile included in the second slice may be encodedand signaled. In this case, the first slice and the second slice may bedetermined based on a scanning order and each slice may be occupied by adifferent tile.

In an example, when a tile constituting the first slice and a tileconstituting the second slice are different, an index of the secondslice may be obtained by adding 1 to an index i of the first slice.

Alternatively, when the first tile is partitioned to include a pluralityof slices, difference information between the first slice included inthe first tile and the second slice including the second tile which isthe next tile of the first tile in a scanning order or between the firstslice included in the first tile and the second slice included in thesecond tile may be encoded. In this case, difference information may beencoded only for the first slice or the last slice among a plurality ofslices included in the first tile.

A tile used to derive difference information between the first slice andthe second slice may be positioned at a top-left, top-right,bottom-right, bottom-left or center of a slice.

Table 10 illustrates a syntax table including difference information.

TABLE 10 pic_parameter_set_rbsp( ) } Descriptor pps_pic_parameter_set_id ue(v)  pps_seq_parameter_set_id ue(v) single_tile_in_pic_flag u(1)  if( !single_tile_in_pic_flag ) }  uniform_tile_spacing_ flag u(1)   if( uniform_tile_spacing_flag ) }   tile_cols_width_minus1 ue(v)    tile_rows_height_minus1 ue(v)   }else {    num_tile_columns_minus1 ue(v)    num_tile_rows_minus1 ue(v)   for( i = 0; i < num_tile_columns_minus1; i++ )    tile_column_width_minus1[ i ] ue(v)    for( i =0; i <num_tile_rows_minus1; i++ )     tile_row_height_minus1[ i ] ue(v)   }  brick_splitting_present_flag u(1)   for( i = 0; brick_present_flag &&i < NumTilesInPic; i++ ) {    brick_split_flag[ i ] u(1)    if(brick_split_flag[ i ]) {     uniform_brick_spacing_flag[ i ] u(1)    if( uniform_brick_spacing_flag[ i ] )      brick_height_minus1[ i ]ue(v)     else {      num_brick_rows_minus1[ i ] ue(v)      for( j = 0;j < num_brick_rows_minus1[ i ]; j++ )       brick_row_height_minus1[ i][ j ] ue(v)     }    }   }   single_brick_per_slice_flag u(1)   if(!single_brick_per_slice_flag )    rect_slice_flag u(1)   if(rect_slice_flag && !single_brick_per_slice_flag ) }   num_slices_in_pic_minus1 ue(v)    for( i = 0; i <=num_slices_in_pic_minus1; i++ ) {     if( i > 0 )     top_left_brick_idx_delta[ i ] u(v)    bottom_right_brick_idx_delta[ i ] u(v)    }   }  loop_filter_across_bricks_enabled_flag u(1)   if(loop_filter_across_bricks_enabled_flag )   loop_filter_across_slices_enabled_flag u(1)  }

In an example, a syntax, top left brick idx delta[i], representing anindex difference between a top-left tile of the i-th slice and atop-left tile of a previous slice (i.e., the (i−1)-th slice), may besignaled in a bitstream.

Based on difference information, a position of a top-left tile in thei-th slice may be determined. Concretely, an index of a top-left tile ofthe i-th slice may be derived by adding an index of a top-left tile ofthe (i−1)-th slice and a syntax, top left brick idx delta[i]. Equation 9represents an example of deriving an index of a top-left tile of thei-th slice.

TopLeftBrickldx[i]=TopLeftBrickIdx[i−1]+top_left_brick_idx_delta[i]  [Equation9]

In the Equation 9, TopLeftBrickIdx[i−1] represents an index of atop-left tile of the (i−1)-th slice.

Encoding of a syntax, top_left_brick_idx_delta[i], representingdifference information with a previous slice may be omitted for thefirst slice (i.e., a slice that an index i is 0). A syntax,bottom_right_brick_idx_delta[i], representing an index differencebetween a top-left tile and a top-right tile of a slice may be encodedand signaled for the first slice.

Table 11 is an example showing a process in which a slice to which eachtile belongs is specified by using difference information.

TABLE 11 NumBricksInSlice[ i ] = 0 TopLeftBrickIdx[0]= 0TopLeftBrickIdx[i] = top_left_brick_idx_delta[i] + TopLeftBrickIdx[i-1]botRightBkIdx = TopLeftBrickIdx[i ] + bottom_right_brick_idx_delta[ i ]for( j = 0; j < NumBricksInPic; j++) }  if( BrickColBd[ j ] >=BrickColBd[ TopLeftBrickIdx[i]] ] &&   BrickColBd[ j ] <= BrickColBd[botRightBkIdx ] &&   BrickRowBd[ j ] >= BrickRowlBd[ TopLeftBrickIdx [ i] ] &&   BrickRowBd[ j ] <= BrickColBd[ botRightBkIdx ] ) {  NumBricksInSlice[ i ]++   BricksToSliceMap[ j ] =i  } }

NumBricksInSlice[i] represents the number of tiles included by a slicei. TopLeftBrickIdx[i] represents an index of a top-left tile of a slicei. botRightBkIdx represents an index of a top-right tile. BrickColBd[j]represents an index of a tile column to which a tile j belongs.BrickRowBd[j] represents an index of a tile row to which a tile jbelongs. BricksToSliceMap[j]=i represents that a tile j is added to aslice i.

Alternatively, a slice may be defined by using information specifying atleast one of a width or a height of a slice. In an example, at least oneof a syntax, slice_width_in_tiles_minus1[i], representing a width of thei-th slice, or a syntax, slice_height_in_tiles_minus1[i], representing aheight of the i-th slice may be signaled in a bitstream.

A syntax, slice_width_in_tiles_minus1[i], represents a value subtracting1 from the number of tile columns included in the i-th slice. A syntax,slice_height_in_tiles_minus1[i], represents a value subtracting 1 fromthe number of tile rows included in the i-th slice.

The i-th slice may be constituted with as many tile columns as thenumber determined based on a syntax, slice_width_in_tiles_minus1[i], andas many tile rows as the number determined based on a syntax,slice_height_in_tiles_minus1[i]. In this case, a top-left tile of thei-th tile column may have an index value determined based ontop_left_brick_idx_delta[i].

Alternatively, a syntax, slice_height_in_tiles_minus1[i], representing aheight of a slice may be signaled only for a slice adjacent to a leftboundary of a picture, and encoding of a syntax,slice_height_in_tiles_minus1[i], may be omitted for other slices. Aheight of a slice that encoding of a syntax,slice_height_in_tiles_minus1[i], is omitted may be set the same as thatof a slice adjoining a left boundary of a current picture among slicesincluded in the same row.

TopLeftBrickIdx[0], an index of a top-left tile of the first slice, maybe set to be 0. Accordingly, for a second slice (i.e., a slice that anindex i is 1), a syntax, top_left_brick_idx_delta[i], substantially hasthe same value as an index of a top-left tile. Accordingly, a syntax,top_left_brick_idx[i], instead of a syntax, top_left_brick_idx_delta[i],may be signaled for the second slice. In this case,top_left_brick_idx[i] represents an index of a top-left tile of the i-thslice.

In another example, a syntax, top_left_brick_idx_delta[i], may be set asa difference between the first tile of the i-th slice and the first tileof the (i+1)-th slice. In other words, an index of a top-left tile ofthe (i+1)-th slice may be derived by summing an index of a top-left tileof the i-th slice and a syntax, top_left_brick_idx_delta[i], signaledfor the i-th slice. When a syntax, top_left_brick_idx_delta[i],represents difference information between the i-th slice and the(i+1)-th slice, encoding of a syntax, top_left_brick_idx_delta[i], maybe omitted for the last slice.

One tile may be partitioned into a plurality of slices. In an example, aplurality of slices may be generated by partitioning a tile in ahorizontal direction or in a vertical direction.

When it is determined that a slice does not include a plurality oftiles, whether a tile will be partitioned into a plurality of slices maybe determined. In an example, when both a syntax,slice_width_in_tiles_minus1[i], and a syntax,slice_height_in_tiles_minus1[i], are 0, it represents that a slice isconstituted with only a single tile, or that a tile is partitioned intoa plurality of slices.

When both a syntax, slice_width_in_tiles_minus1[i], and a syntax,slice_height_in_tiles_minus1[i], are 0, information representing whethera tile is partitioned into a plurality of slices may be signaled. In anexample, a syntax, num_exp_slices_in_tile[i], representing informationon the number of slice heights which should be explicitly signaled maybe signaled in a bitstream. A syntax, num_exp_slices_in_tile[i], mayhave a value which is the same as or smaller than the number of slicesincluded by a tile.

When a syntax, num_exp_slices_in_tile[i], is 0, it represents that atile is not partitioned into a plurality of slices. When a syntax,num_exp_slices_in_tile[i], is greater than 0, it represents that a tilemay be partitioned into a plurality of slices.

Information representing a height of a slice may be signaled as many asa value indicated by a syntax, num_exp_slices_in_tile[i]. In an example,when a syntax, num_exp_slices_in_tile[i], is greater than 1, a syntax,exp_slice_height_in_ctu_minus1[j], representing a height of the j-thslice in a tile, may be signaled.

When an index j of a slice is smaller than the number of slices whoseheight is explicitly signaled, a width of a slice j may be determinedbased on a syntax, exp_slice_height_in_ctu_minus1[j], signaled in abitstream. On the other hand, when an index k of a slice is equal to orgreater than the number of slices whose height is explicitly signaled, aheight of a slice k may be determined based on a syntax,exp_slice_height_in_ctu_minus1[l], which is signaled last. In this case,l may represent an index of a slice whose height is signaled last andmay be an integer smaller than k.

In an example, when a value subtracting a height of previous slices froma height of a tile is equal to or greater than a value adding 1 to asyntax, exp_slice_height_in_ctu_minus1[l], a height of a slice k may beset as a value adding 1 to a syntax, exp_slice_height_in_ctu_minus1[l].On the other hand, when a value subtracting a height of previous slicesfrom a height of a tile is smaller than a value adding 1 to a syntax,exp_slice_height_in_ctu_minus1[l], a difference value subtracting aheight of previous slices from a height of a tile may be set as a heightof a slice k.

In other words, a height of remaining slices excluding slices whoseheight is explicitly signaled may have a value smaller than or the sameas a height of the last slice of slices whose height is explicitlysignaled.

When the number of tile columns in a current picture is 1, encoding of asyntax, slice_width_in_tiles_minus1, may be omitted. In addition, whenthe number of tile rows in a current picture is 1, encoding of a syntax,slice_height_in_tiles_minus1, may be omitted.

Alternatively, encoding of at least one of information representing awidth of a slice or information representing a height of a slice may beomitted.

In an example, encoding of a syntax, slice_width_in_tiles_minus1,representing a width of a slice may be omitted and a distance with atile at a predetermined position in an adjacent slice may be set as awidth of a slice. Concretely, a top-left tile of the (i+1)-th sliceadjacent to the right of the i-th slice may be specified by a syntax,top_left_brick_idx_delta[i]. A width of the i-th slice may be derived bya difference between an x-coordinate of a top-left tile in the i-thslice (e.g., an x-coordinate of a top-left sample) and an x-coordinateof a top-left tile in the (i+1)-th slice (e.g., an x-coordinate of atop-left sample).

Alternatively, encoding of a syntax, slice_height_in_tiles_minus1,representing a height of a slice may be omitted and a distance with atile at a predetermined position in an adjacent slice may be set as awidth of a slice. Concretely, a top-left tile of the j-th slicepositioned at the bottom of the i-th slice may be specified by a syntax,top_left_brick_idx_delta[j−1]. A height of the i-th slice may be derivedby a difference between a y-coordinate of a top-left tile in the i-thslice (e.g., a y-coordinate of a top-left sample) and a y-coordinate ofa top-left tile in the j-th slice (e.g., a y-coordinate of a top-leftsample).

Alternatively, in defining a slice in a rectangular shape, informationrepresenting whether difference value information is used may besignaled in a bitstream. In an example, delta_present_flag representingwhether difference value information is used may be signaled in abitstream. When a value of a syntax, delta_present_flag, is 1, itrepresents that a syntax representing a difference value of a tile indexis encoded and signaled. In an example, when a value of a syntax,delta_present_flag, is 1, the i-th slice may be defined by a syntax,slice_width_in_tiles_minus1[i], and a syntax,slice_height_in_tiles_minus1[i], representing a size of a slice anddifference value information for determining a position of a top-lefttile or a position of a top-right tile in a slice (e.g.,top_left_brick_idx_delta[i−1] or bottom right brick idx delta[i]).

When a value of a syntax, delta_present_flag, is 0, the i-th slice maybe defined by a syntax, slice_width_in_tiles_minus1[i], and a syntax,slice_height_in_tiles_minus1[i], representing a size of a slice. When avalue of a syntax, delta_prsent_flag, is 0, a slice adjacent to theright of a slice adjoining a left boundary of a current picture may beset to have the same height each other. Accordingly, informationrepresenting a height of a slice may be signaled only for a sliceadjoining a left boundary of a current picture and signaling ofinformation representing a height of a slice may be omitted for a slicewhich does not adjoin a left boundary of a current picture.

It is possible to define a slice based on an index of a coding tree unitinstead of an index of a tile.

In the above-described example, it is assumed that a slice is defined bygiving an order to tiles according to a raster scanning order. Inanother example, a slice may be defined by giving an order to tilesaccording to vertical scanning, horizontal scanning or diagonalscanning.

Applying the embodiments as described about the decoding process or theencoding process to the encoding process or the decoding processrespectively may be included in the scope of the present disclosure.Within the scope of the present disclosure, the embodiments in whichoperations occur in a predetermined order may be modified to embodimentsin which the operations occur in a different order from thepredetermined order.

Although the above-described embodiment is described based on a seriesof the operations or the flowchart, the embodiment does not limit atime-series order of the operations of the method thereto. In anotherexample, the operations may be performed simultaneously or in adifferent order therefrom as necessary. Further, in the above-describedembodiment, each of the components (for example, a unit, a module, etc.)constituting the block diagram may be implemented in a form of ahardware device or software. A plurality of components may be combinedwith each other into a single component which may be implemented using asingle hardware device or software. The above-described embodiment maybe implemented using program instructions that may be executed viavarious computer components. The instructions may be recorded in acomputer-readable storage medium. The computer-readable storage mediummay contain therein program instructions, data files, data structures,or the like alone or in combination with each other. Examples of thecomputer-readable storage media include magnetic media such as harddisks, floppy disks, and magnetic tapes, optical storage media such asCD-ROMs, DVDs, and magneto-optical media such as floptical disks, andhardware devices such as ROM, RAM, flash memory, and the likespecifically configured to store therein and execute the programinstructions. The hardware device may be configured to operate as one ormore software modules to perform processing according to the presentdisclosure, and vice versa.

INDUSTRIAL AVAILABILITY

The present disclosure may be applied to an electronic device thatencodes/decodes video.

What is claimed is:
 1. A video decoding method comprising: partitioninga current picture into a plurality of tiles; decoding partitioninginformation representing a definition method of a slice; wherein thepartitioning information represents a first definition method based onraster scanning or a second definition method based on a rectangularshape; and determining a first slice based on the partitioninginformation; and wherein when the partitioning information indicates thesecond definition method, the first slice is determined based ondifference value information representing an index difference valuebetween a first one among tiles in the first slice and a first one amongtiles in a second slice.
 2. The method of claim 1, wherein signaling ofthe difference value information is omitted for a first one or a lastone among slices in the current picture.
 3. The method of claim 1,wherein a size of the first slice is determined based on widthinformation of the first slice and height information of the firstslice.
 4. The method of claim 1, wherein when the first slice does notadjoin a left boundary in the current picture, height information is setthe same as height information of a previous slice of the first slice.5. The method of claim 1, wherein when the partitioning informationindicates the first definition method, the first slice is determinedbased on information representing a number of tiles included in thefirst slice.
 6. A video encoding method comprising: partitioning acurrent picture into a plurality of tiles; determining a definitionmethod of a slice; wherein the definition method represents a firstdefinition method based on raster scanning or a second definition methodbased on a rectangular shape; and determining a first slice based on thedefinition method; and wherein when the definition method indicates thesecond definition method, difference value information representing anindex difference value between a first one among tiles in the firstslice and a first one among tiles in a second slice is encoded.
 7. Themethod of claim 6, wherein encoding of the difference value informationis omitted for a first one or a last one among slices in the currentpicture.
 8. The method of claim 6, wherein width information or heightinformation of the first slice is further encoded.
 9. The method ofclaim 6, wherein when the first slice does not adjoin a left boundary inthe current picture, encoding of height information is omitted.
 10. Themethod of claim 6, wherein when the definition method is determined asthe first definition method, information representing a number of tilesincluded by the first slice is further encoded.